StarWalker

Where my heart will take me

0%

Leetcode169-majorityElement

Posted on Edited on In Views: Valine:
Solution Report of LeetCode Acceptted

Description

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

Example 1:

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

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

Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
// Boyer-Moore Majority Algorithm
class Solution {
    public int majorityElement(int[] nums) {
        int candidate = 0;
        int count = 0;
        for (int num : nums){
            if (count == 0)
                candidate = num;
            if (candidate == num)
                count++;
            else count--;
        }
        return candidate;
    }
}