题目
Given an array of sizen, 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.
Credits:Special thanks to@tsfor adding this problem and creating all test cases.
代码
import java.util.Hashtable;import java.util.Iterator;public class Solution {public int majorityElement(int[] num) {Hashtable<Integer,Integer> rightList = new Hashtable<Integer,Integer>();for(int i=0;i<num.length;i++){if(rightList.get(num[i])==null){rightList.put(num[i], 1);}else{rightList.put(num[i], rightList.get(num[i])+1);}}int result_value=0;int result_key=0;for(Iterator itr = rightList.keySet().iterator(); itr.hasNext();){int key = (Integer) itr.next();if(rightList.get(key)>result_value){result_key=key;result_value=rightList.get(key);}}return result_key;}}
代码下载：https://github.com/jimenbian/GarvinLeetCode
/********************************
* 本文来自博客 “李博Garvin“
* 转载请标明出处:
******************************************/
，答：他是憋死的，因为沙漠里没有电线杆撒尿。问：
