解题思路

哈希表

Boyer-Moore 投票算法

 int count = 0;
        Integer candidate = null;
        for(int num:nums){
            if(count == 0){
                candidate = num;
            }
            count += (num == candidate)?1:-1;
        }
        return candidate;