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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

一一消掉最后还剩下的就是

public class Solution {    public int majorityElement(int[] nums) {       int candidate = 0;        int count = 0;        for(int i = 0; i < nums.length ;i ++)        {            if(count == 0)            {                candidate = nums[i];                count = 1;            }            else            {                if(nums[i] == candidate)                    count ++;                else                    count --;            }        }        return candidate;    }}