题目链接:https://leetcode.com/problems/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.
思路:本题有两种方法:1.基于快速排序的分割算法,partition函数每次会把数组分成两个部分,并把一个值排在正确的位置,如果这个位置是在n/2处,则说明这个数必然是出现超过n/2次的数。这种方法同样可以处理寻找第K大的数。
代码如下:
class Solution {
public:
int partition(vector<int>& nums, int low, int high)
{
int val = nums[high], k =low-1;
for(int i = low; i < high; i++)
if(nums[i] < val) swap(nums[i], nums[++k]);
swap(nums[high], nums[++k]);
return k;
}
int majorityElement(vector<int>& nums) {
int len = nums.size(), low = 0, high = len -1, mid=len/2;
while(low < high && (mid=partition(nums, low, high))!= len/2)
{
if(mid > len/2) high = mid-1;
else low = mid+1;
}
return nums[len/2];
}
};
2. 还有一种是BM投票算法,设置一个计数器,如果计数器为0,则统计当前数的个数,否则如果当前数等于要等于要统计的数则计数器加1,否则减一。
代码如下:
class Solution {
public:
int majorityElement(vector<int>& nums) {
int cnt = 0, num, len = nums.size();
for(int i =0; i< nums.size(); i++)
{
if(cnt == 0) num = nums[i];
cnt = (num == nums[i])?(cnt+1):(cnt-1);
}
return num;
}
};