Leetcode - 169. Majority Element (多数投票问题)

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 = None
    count = 0

    for item in nums:

        if item == candidate:
            count+=1

        elif count > 0:
            count -= 1

        else:
            candidate,count = num,1

    return candidate