題目

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.

Credits:
Special thanks to?@ts?for 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“

* 轉載請標明出處:http://blog.csdn.net/buptgshengod

******************************************/

總結

以上是生活随笔為你收集整理的【LeetCode从零单排】No.169 Majority Element(hashmap用法)的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。