169. Majority Element

最新推荐文章于 2022-04-16 14:23:13 发布

cgfankai

最新推荐文章于 2022-04-16 14:23:13 发布

阅读量158

点赞数

分类专栏： LeetCode OJ

本文链接：https://blog.csdn.net/cgfankai/article/details/50739881

版权

LeetCode OJ 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

public class Solution {
    public int majorityElement(int[] nums) {
        HashMap<Integer, Integer> elementNum = new HashMap(nums.length/2);
	        for (int element : nums) {
				if (elementNum.containsKey(element)) {
					elementNum.put(element, elementNum.get(element)+1);
				}
				else {
					elementNum.put(element, 1);
				}
			}
	        Set<Map.Entry<Integer, Integer>> set = elementNum.entrySet();
	        Iterator<Map.Entry<Integer, Integer>> iter = set.iterator();
	        while (iter.hasNext()) {
				Map.Entry<java.lang.Integer, java.lang.Integer> entry = (Map.Entry<java.lang.Integer, java.lang.Integer>) iter
						.next();
				if (entry.getValue()>nums.length/2) {
					return entry.getKey();
				}
				
			}
			return 0;
    }
}

解法二：

public class Solution {
    public int majorityElement(int[] nums) {
        if (nums.length == 1) {
			return nums[0];
		}
	        int[][] keyValue = new int[nums.length][2];
	        int sumDiffNum = 0,stus = 0;
	        for (int i = 0; i < nums.length; i++) {
	        	stus = 0;
				for (int j = 0; j < sumDiffNum+1; j++) {
					if (nums[i]==keyValue[j][0]) {
						keyValue[j][1]++;
						stus = 1;
						break;
					}
				}
				if (stus == 0) {
					keyValue[sumDiffNum][0] = nums[i];
					keyValue[sumDiffNum][1] = 1;
					sumDiffNum++;
					stus = 0;
				}
			}
	        for (int i = 0; i < sumDiffNum+1; i++) {
				if (keyValue[i][1]>nums.length/2) {
					return keyValue[i][0];
				}
			}
	        return nums[0];
    }
}