我用了O(nlogn)的方法。
或者可以用Hashmap记录出现次数。
据说有更好的方法叫投票法。
//先sort，再遍历，遇到个数大于n了，返回它
public int majorityElement(int[] nums) {
if (nums.length == 1) return nums[0];
Arrays.sort(nums);
int count = 1;
for (int i = 1; i < nums.length; i++) {
if (nums[i] != nums[i - 1]) {
count = 1;
} else {
count++;
}
if (count > nums.length / 2) return nums[i];
}
return -1;
}
D83 169. Majority Element 题目链接 169. Majority Element 题目分析...
169. Majority Element[思路] 利用map；
169. Majority Element Description Given an array of size ...
Leetcode 169. Majority Element Given an array of size n, ...
169. Majority Element Given an array of size n, find the ...
169. Majority Element Given an array of size n, find the...
169. Majority Element https://leetcode.com/problems/major...
169. Majority Element https://leetcode.com/problems/major...
分类：分治/sort/位运算/vote/HashMap/Random 169. Majority Element ...
题目169. Majority Element Given an array of size n, find th...
本文标题：169. Majority Element
本文链接：https://www.haomeiwen.com/subject/fjfskxtx.html
网友评论