# -*- coding:utf-8 -*- classSolution: defMoreThanHalfNum_Solution(self, numbers): # write code here res = [] length = len(numbers) / 2 for i in numbers: if i in res: continue res.append(i) if numbers.count(i) > length: return i returnFalse
运行时间:26ms 占用内存:5856k
中位数法
1 2 3 4 5 6 7 8 9 10
# -*- coding:utf-8 -*- classSolution: defMoreThanHalfNum_Solution(self, numbers): # write code here numbers_s = sorted(numbers) length = len(numbers_s) / 2 median = numbers[int(length)] if numbers_s.count(median) > length: return median returnFalse