LeetCode 题解(128): 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.

题解:

给定majority一定存在,所以用网上学来的一次扫描算法, 用一个count和一个current表示当前的majority数,最后的current就是majority。

C++版:

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        int current = nums[0];
        int count = 1;
        for(int i = 1; i < nums.size(); i++) {
            if(count == 0) {
                current = nums[i];
                count++;
            } else {
                if(current == nums[i]) {
                    count++;
                } else {
                    count--;
                }
            }
        }
        return current;
    }
};

Java版:

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

Python版:

class Solution:
    # @param {integer[]} nums
    # @return {integer}
    def majorityElement(self, nums):
        count = 1
        current = nums[0]
        for i in range(1, len(nums)):
            if count == 0:
                current = nums[i]
                count = 1
            else:
                if current == nums[i]:
                    count += 1
                else:
                    count -= 1
        return current


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值