0%

Algorithm-摩尔投票法

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
/**
* 摩尔投票法
*
* @param nums
* @return
*/
public static int majorityElement(int[] nums) {
int count = 0;
int num = nums[0];
for (int i = 1; i < nums.length; i++) {
if (nums[i] != num) {
count--;
if (count < 0) {
count = 0;
num = nums[i];
}
} else
count++;
}
return num;
}

Link:https://blog.csdn.net/shxifs/article/details/91352407