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.
Example 1:
1
2
|
Input: [3,2,3]
Output: 3
|
Example 2:
1
2
|
Input: [2,2,1,1,1,2,2]
Output: 2
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
class {
public int majorityElement(int[] nums) {
if (nums == null || nums.length == 0) {
return -1;
}
if (nums.length == 1) {
return nums[0];
}
int k = -1;
int count = 0;
for (int i = 0; i < nums.length; i++) {
if (count == 0) {
k = nums[i];
count = 1;
continue;
}
if (nums[i] == k) {
count++;
} else {
count--;
}
}
return k;
}
}
|
近期评论