Given an array of size?n, find the majority element. The majority element is the element that appears?more than?? n/2 ??times.

You may assume that the array is non-empty and the majority element always exist in the array.

Example 1:

Input: [3,2,3] Output: 3

Example 2:

Input: [2,2,1,1,1,2,2] Output: 2 def majorityElement(nums):candidate = Nonecount = 0for item in nums:if item == candidate:count+=1elif count > 0:count -= 1else:candidate,count = num,1return candidate

?

總結(jié)

以上是生活随笔為你收集整理的Leetcode - 169. Majority Element (多数投票问题)的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。