Given an integer array of size?n, find all elements that appear more than?? n/3 ??times. The algorithm should run in linear time and in O(1) space.

Hint:

How many majority elements could it possibly have?

Do you have a better hint??Suggest it!

Subscribe?to see which companies asked this question

還是用抵消的辦法
開始的參數是0.5，通過了
后來改成1 ，也通過了……

class Solution(object):def majorityElement(self, nums):a = '' #nums[0]b = '' #nums[1]ta = 0tb = 0l = len(nums)if l == 2:return list(set(nums))times = l/3for i in nums[:]:if i == a:ta += 1elif i == b:tb += 1elif ta <= 0:a = ita = 1elif tb <= 0:b = itb = 1else:ta -= 1tb -= 1res = []if nums.count(a) > times:res += a,if a != b and nums.count(b) > times:res += b,return res

總結

以上是生活随笔為你收集整理的229. Majority Element II 【M】【52】的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。