时间复杂度(O(n)),思想:拼子(类似下棋,棋子占优势时可以通过拼子获胜)
class Solution:
def majorityElement(self, nums: List[int]) -> int:
_num, _count = None, 0
for num in nums:
if _num == num:
_count += 1
elif _count == 0:
_num, _count = num, 1
else:
_count -= 1
return _num