169. 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.

思路：

因为一定存在Majority Element，所以Majority Element的个数减去其他所有数字的个数一定大于0

public int majorityElement(int[] nums) {
int count = 0;
int res = 0;
for (int i = 0; i < nums.length; i++) {
if (count == 0) {
count = 1;
res = nums[i];
} else {
if (res == nums[i]) {
count++;
} else {
count--;
}
}
}
return res;
}