题目链接:https://leetcode.com/problems/majority-element/#/solutions
题目要求:找出数组中的主元素
方法一:首先最容易想到的方法是,将数组排序,最中间的数就是主元素。该方法的时间复杂度即为排序的时间复杂度,为O(n logn)
Java代码如下:
public class Solution {
public int majorityElement(int[] nums) {
Arrays.sort(nums);
return nums[nums.length/2];
}
}
方法二:
public class Solution {
public int majorityElement(int[] nums) {
int major = nums[0];
int count = 1;
for (int i = 1; i < nums.length; i++) {
if (count == 0) {
major = nums[i];
count++;
} else if (major == nums[i]) {
count++;
} else {
count--;
}
}
return major;
}
}