https://leetcode.com/problems/majority-element/
题意
- 排序后（n/2位置即结果）位置即结果
- https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_majority_vote_algorithm
class Solution {
public int majorityElement(int[] nums) {
//Boyer Moore Voting Algorithm
int count = 0, candidateIdx = -1;
for (int i = 0; i < nums.length; i++) {
if (count == 0) {
candidateIdx = i;
}
if (nums[i] == nums[candidateIdx]) {
count++;
} else {
count--;
}
}
return nums[candidateIdx];
}
}