首页 > 代码库 > LeetCode Majority Element
LeetCode 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.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
1 public class Solution { 2 public int majorityElement(int[] num) { 3 int length=num.length; 4 if (length==1) { 5 return num[0]; 6 } 7 HashMap<Integer, Integer> map =new HashMap<>(); 8 for (int i = 0; i < length; i++) { 9 if (!map.containsKey(num[i])) {10 map.put(num[i], 1);11 }else {12 int value=http://www.mamicode.com/map.get(num[i])+1;13 if (value>length/2) {14 return num[i];15 }else {16 map.put(num[i], value);17 }18 19 20 }21 }22 return 0;23 }24 }
LeetCode Majority Element
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。