给定一个整型数组,找到主元素,该元素在数组中出现的次数大于等于该数组元素个数的 1/3
参考代码:
class Solution: def majorityNumber(self, nums): nums.sort() i = 0 j = 0 while i <= len(nums): j = nums.count(nums[i]) if j > len(nums)//3: return nums[i] i += j return