leetcode 169. Majority Element

Posted 2020-10-10 Militant_799

题意：数组长度为N，找出数组中元素出现个数大于N/2 的元素

public class Solution {
    public int majorityElement(int[] num) {

        int major=num[0], count = 1;
        for(int i=1; i<num.length;i++){
            if(count==0){
                count++;
                major=num[i];
            }else if(major==num[i]){
                count++;
            }else count--;
            
        }
        return major;
    }
}