[Leetcode] 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.

public class Solution {
public int majorityElement(int[] nums) {
int count = 0;
int majority = nums[0];
for(int num : nums) {
if(num == majority)
count++;
else
count--;

if(count == -1){
count = 1;
majority = num;
}
}
return majority;
}
}