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 n = nums.length; int candidate = 0; int times = 0; for(int i = 0; i < n; i++){ if(times == 0) candidate = nums[i]; if(nums[i] != candidate){ times--; } else{ times++; } } return candidate; } } ~~~