LeetCode [169] Majority Element

 169. Majority Element

Easy

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:

Input: [3,2,3]
Output: 3

Example 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

class Solution { public int majorityElement(int[] nums) { int mv=nums[0], mc = 1; for(int i=1; i<nums.length; ++i){ if(mc>0){ if(mv==nums[i]) mc++; else mc--; }else{ mv = nums[i]; mc++; } } return mv; } }