LeetCode: Majority Element

// https://code.dennyzhang.com/majority-element
// Basic Ideas: morevoting
//
// For two different values, collision these two
//
// Complexity: Time O(n), Space O(1)
func majorityElement(nums []int) int {
    v, cnt := nums[0], 1
    for i:=1; i<len(nums); i++ {
        if nums[i] == v { 
            cnt++ 
        } else {
            cnt--
            if cnt == 0 {
                i++
                v, cnt = nums[i], 1
            }
        }
    }
    return v
}

## https://code.dennyzhang.com/majority-element
class Solution(object):
    def majorityElement1(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        ## Ideas: sort, then find the middle item
        ## Complexity: Time O(n*log(n)), Space O(1)
        length = len(nums)
        nums2 = sorted(nums)
        return nums2[(length-1)/2]