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.

思路一：使用HashMap
代码如下：

class Solution {
    public int majorityElement(int[] nums) {
        HashMap<Integer,Integer> hash = new HashMap<Integer,Integer>();
        int val = 0;
        for(int i = 0;i<nums.length;i++){
            val = nums[i];
            if(!hash.containsKey(val))
                hash.put(val,0);
            int num = hash.get(val)+1;
            hash.replace(val,num);
            if(num>nums.length/2)
                break;
        }
        return val;        
    }
}

注意：
- Map<int,int> map=new Map<int,int>();错误
泛型的声明必须是一个类，int是基本数据类型而不是一个类，应该用int的封装类Integer做声明，也就是Map<Integer,Integer>

思路二：使用Moore’s Voting Algorithm

具体见我的博客

代码如下：

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