Leetcode-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.

Example 1:

Input: [3,2,3]

Output: 3

方法一、用快排。。。不知道为什么能想到这么奇怪的方法，可能是来自于对快排的爱吧。

class Solution {
    public int majorityElement(int[] nums) {
        Qsort(nums,0,nums.length-1);
        int count=0;
        int majority=0;
        if (nums.length==1){
            return nums[0];
        }
        for(int i=0;i<nums.length;i++){
            if(count==0){
                count++;
            }
            else{
                if(nums[i-1]==nums[i]){
                    count++;
                    if (count>nums.length/2){
                        majority= nums[i];
                        break;
                    }
                }
                else{
                    count=1;
                }
            }
        }
        return majority;
    }
    
    public static void Qsort(int[] nums, int first, int last){
        if(first>=last){
            return;
        }
        int first_index=first;
        int last_index=last;
        int key=nums[first];
        while(first_index<last_index){
            while(first_index<last_index&&nums[last_index]>=key){
                last_index--;
            }
            nums[first_index]=nums[last_index];
            
            while(first_index<last_index&&nums[first_index]<=key){
                first_index++;
            }
            nums[last_index]=nums[first_index];
        }
        nums[first_index]=key;
        Qsort(nums,first,first_index);
        Qsort(nums,first_index+1,last);
    }
    
}

方法二、受原来做过的题的启发想到了hashmap，不过还是慢

import java.util.HashMap;
import java.util.Map;
class Solution {
    public int majorityElement(int[] nums) {
        Map count_num = new HashMap<Integer,Integer>();
        for(int i=0; i<nums.length;i++){
            if(count_num.containsKey(nums[i])){
                count_num.put(nums[i],(int)(count_num.get(nums[i]))+1);
                if ((int)(count_num.get(nums[i]))>nums.length/2){
                    return nums[i];
                }
            }
            else{
                count_num.put(nums[i],1);
                if ((int)(count_num.get(nums[i]))>nums.length/2){
                    return nums[i];
                }
            }
        }
        return 0;
    }
    
    
    
}

方法三、使用了个技巧？如果数量超过n/2，那么排完序之后n/2的位置就是这个数

class Solution {
    public int majorityElement(int[] nums) {
        Arrays.sort(nums);
        return nums[nums.length/2];
    }
}