In this Kata, you will be given a string that has lowercase letters and numbers. Your task is to compare the number groupings and return the largest number. Numbers will not have leading zeros. 
For example, `solve("gh12cdy695m1") = 695`, because this is the largest of all number groupings. 
Good luck!
Please also try [Simple remove duplicates](https://www.codewars.com/kata/5ba38ba180824a86850000f7)
def solve(s):
    s += 'a'
    digits = list('0123456789')
    biggest = 0
    current = ''
    list_of_numbers = []
    for i in range(len(s)):
        if s[i] in digits:
            current += s[i]
        else:
            list_of_numbers.append(current)
            current = ''
    
    while '' in list_of_numbers:
        list_of_numbers.remove('')
    list_of_ints = []
    for j in range(len(list_of_numbers)):
        list_of_numbers[j] = int(list_of_numbers[j])
        list_of_ints.append(list_of_numbers[j])
    biggest = max(list_of_ints)
    return biggest
pass

def solve(s):
    s += 'a'
    digits = list('0123456789')
    biggest = 0
    current = ''
    list_of_numbers = []
    for i in range(len(s)):
        if s[i] in digits:
            current += s[i]
        else:
            list_of_numbers.append(current)
            current = ''
    
    while '' in list_of_numbers:
        list_of_numbers.remove('')
    list_of_ints = []
    for j in range(len(list_of_numbers)):
        list_of_numbers[j] = int(list_of_numbers[j])
        list_of_ints.append(list_of_numbers[j])
    biggest = max(list_of_ints)
    return biggest
pass
