【Leetcode-Easy-169】 Majority Element

最新推荐文章于 2021-09-12 12:31:23 发布

LYZ0907

最新推荐文章于 2021-09-12 12:31:23 发布

阅读量519

点赞数

分类专栏： Leetcode LeetCode

本文链接：https://blog.csdn.net/liyazhou0215/article/details/78271556

版权

Leetcode 同时被 2 个专栏收录

50 篇文章

订阅专栏

LeetCode

50 篇文章

订阅专栏

【Leetcode-Easy-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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

思路

充分使用数据的特征

程序

class Solution {
    public int majorityElement(int[] nums) {
        int counter = 0;
        int curr = nums[0];
        for (int i = 0; i < nums.length; i ++){
            if (counter == 0) curr = nums[i];

            if (nums[i] == curr) counter ++;
            else{
                counter --;
                if (counter <= 0) counter = 0;
            }
        }
        return curr;
    }
}