Major Element

最新推荐文章于 2024-08-08 18:15:31 发布

weixin_30315435

最新推荐文章于 2024-08-08 18:15:31 发布

阅读量102

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/amazingzoe/p/9065566.html

本文介绍了一种寻找数组中多数元素的高效算法。多数元素是指在数组中出现次数超过一半的元素。文章通过示例展示了算法的工作原理，并提供了一个简洁的Java实现。

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

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