Boyer-Moore Majority Voting Algorithm(摩爾/多數投票算法)

面試實際可能會遇到的問題：

「時間/空間複雜度？」

(O(n), O(1)，除了一些變數以外我們沒有使用到額外的空間)


var majorityElement = function(nums) {
    let count = 0
    let candidate
    for (let i = 0; i < nums.length; i++) {
        if (count === 0) {
            candidate = nums[i]
            count = 1
        } else if (candidate === nums[i]) {
            count++
        } else {
            count--
        }
    }

   return candidate
};


var majorityElement = function(nums) {
    let count = 0
    let candidate
    for (let i = 0; i < nums.length; i++) {
        if (count === 0) {
            candidate = nums[i]
            count = 1
        } else if (candidate === nums[i]) {
            count++
        } else {
            count--
        }
    }

   return candidate
};