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

Example 1:

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

Example 2:

Input: [2,2,1,1,1,2,2]
Output: 2

Solution

class Solution {
 public int majorityElement(int[] nums) {
 
 int m = -1;
 
 int i = 0;
 
 for(int n : nums) {
 
 if(i==0){
 m = n;
 i++; 
 } else if(n == m){
 i++;
 } else {
 i — ;
 }
 
 }
 
 return m;
 
 }
}