[codewars]4.找到数组中唯一奇偶异常元素

For example: [2, 4, 0, 100, 4, 11, 2602, 36 Should return: 11 [160, 3, 1719, 19, 11, 13, -21] Should return: 160

# my_version 未通过复杂测试 def find_outlier(integers): if sum(integers) % 2 == 0: return [n for n in integers if n%2 == 0][0] else: return [n for n in integers if n%2 == 1][0] # best_solution def find_outlier(int): odds = [x for x in int if x%2!=0] evens= [x for x in int if x%2==0] return odds[0] if len(odds)<len(evens) else evens[0]