输出字符串中的子字符串

class Solution:
    def findTheLongestSubstring(self, s):
        s1={'a':0, 'e':0, 'i':0, 'o':0, 'u':0}
        s2=['a', 'e', 'i', 'o', 'u']

        s1['a'] += s.count('a')
        s1['e'] += s.count('e')
        s1['i'] += s.count('i')
        s1['o'] += s.count('o')
        s1['u'] += s.count('u')
        
        def findson(w, s):
            s_len = len(s)-1
            if s1[w]%2==0:
                find_son = [0, len(s)]
            else:
                find_num1 = s.find(w)
                find_num2 = s.rfind(w)
                if (find_num1) > (s_len-find_num2):
                    find_son = [0, find_num2]
                else:
                    find_son = [find_num1+1, len(s)]
            return find_son

        if s1['a']%2==0 and s1['e']%2==0 and s1['i']%2==0 and s1['o']%2==0 and s1['u']%2==0:
            return len(s)
        else:
            a_son = findson('a', s)
            e_son = findson('e', s)
            i_son = findson('i', s)
            o_son = findson('o', s)
            u_son = findson('u', s)
            s_min = max([a_son[0], e_son[0], i_son[0], o_son[0], u_son[0]])
            s_max = min([a_son[1], e_son[1], i_son[1], o_son[1], u_son[1]])
            s = s[s_min:s_max]
            return Solution().findTheLongestSubstring(s)