[leetcode] problem 169 – 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

No.1

Input: [3,2,3]

Output: 3

No.2

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

Output: 2

Code

public int (int[] nums) {
    int result = 0;
    int count = 0;

    for (int num : nums) {
        if (count == 0) {
            result = num;
            count = 1;
        }
        else if (num != result)
            count--;
        else
            count++;
    }

    return result;
}

[leetcode] problem 169 – majority element

Example

No.1

No.2

Code

近期文章

近期评论

标签

热门

文章归档

分类目录

功能