开始刷题leetcode day3： 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.

Java

public class Solution {
    public int majorityElement(int[] nums) {
        HashMap<Integer,Integer> map = new HashMap<Integer, Integer>();
        for(int i=0; i<nums.length; i++)
        {
            if(map.get(nums[i]) == null)
                map.put(nums[i], 0);
            else
            {
                map.put(nums[i], map.get(nums[i]) + 1);
            }
            if(map.get(nums[i]) >= nums.length/2) return nums[i];
        }
        
       return -1;
    }
}

注意if(map.get(nums[i]) >= nums.length/2) return nums[i];的位置