题目:
给定一个大小为n的数组,找到多数元素。多数元素指至少⌊n / 2⌋次出现。
可假设数组是非空的,并且存在符合条件的数。
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.
Input: [3,2,3] Output: 3 Input: [2,2,1,1,1,2,2] Output: 2
思路:
由于多数元素都是大于⌊n / 2⌋次出现的,因此采用快排中定位元素的函数,如果一个数最后定位到在中位数(中间)位置,则该数为所需求的数
代码:
class Solution {
public int majorityElement(int[] nums) {
int loc=0;
int start = 0,end=nums.length-1;
while(loc!=nums.length/2) {
loc = findLoc(nums, start, end);
if(loc==nums.length/2) {
return nums[loc];
}else {
if(loc<nums.length/2) {
start = loc+1;
}else {
end = loc-1;
}
}
}
return nums[loc];
}
// 快排定位函数
public int findLoc(int[] nums, int start, int end) {
int loc = start;
while(start<end) {
while(start<end && nums[end]>=nums[loc]) {
end--;
}
while(start<end && nums[start]<=nums[loc]) {
start++;
}
int temp = nums[end];
nums[end] = nums[start];
nums[start] = temp;
}
int temp = nums[loc];
nums[loc] = nums[end];
nums[end] = temp;
return end;
}
}