程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> 關於C++ >> [LeetCode]Majority Element

[LeetCode]Majority Element

編輯:關於C++

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.

存入HashMap然後遍歷


public class Solution {
    public int majorityElement(int[] num) {
        Map map = new HashMap<>();
        for(int i=0;i it = map.keySet().iterator();
        while(it.hasNext()){
        	int val = it.next();
        	if(map.get(val)>num.length/2){
        		return val;
        	}
        }
        return -1;
    }
}





  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved