169. Majority Element【力扣】

题意理解

求一个序列的众数，出现次数大于n / 2的数。

问题分析

数组

Boyer-Moore 投票算法

遍历每个元素，count连续出现的数字个数，candiate表示数字本身。如果count为0，当前数字作为候选，如果当前数字不等于候选count-1，否则count+1.

其他

复杂度是o(n), 空间复杂度是o(1)

链接

    int majorityElement(vector<int>& nums) {int count = 0;int candidate = 0;for(int a : nums)    //遍历序列{if (count == 0)    //当前计数为0{candidate = a;    //候选变成当前数}count += (candidate == a ? 1 : -1);    //候选等于当前数，计数加1，不等于计数就减1.}return candidate;    //最后的候选就是求的众数。}

https://leetcode.com/articles/majority-element/

169. Majority Element【力扣】相关推荐

leetcode讲解--169. Majority Element
169. Majority Element Given an array of size n, find the majority element. The majority element is t ...
[Easy] 169. Majority Element
169. Majority Element Given an array of size n, find the majority element. The majority element is t ...
[勇者闯LeetCode] 169. Majority Element
[勇者闯LeetCode] 169. Majority Element Description Given an array of size n, find the majority element. ...
leetcode python3 简单题169. Majority Element
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百六十九题 (1)题目英文: Given an array of size n ...
leetcode 169. Majority Element
Given an array of size n, find the majority element. The majority element is the element that appear ...
【LeetCode】169. Majority Element
原题链接:https://leetcode.com/problems/majority-element/description/ 要求: Given an array of size n, find ...
Leetcode - 169. Majority Element (多数投票问题)
Given an array of size n, find the majority element. The majority element is the element that appear ...
【LeetCode从零单排】No.169 Majority Element(hashmap用法)
题目 Given an array of size n, find the majority element. The majority element is the element that app ...
[LeetCode]: 169: Majority Element
题目: Given an array of size n, find the majority element. The majority element is the element that ap ...
169. Majority Element
Given an array of size n, find the majority element. The majority element is the element that appear ...

169. Majority Element【力扣】

169. Majority Element【力扣】相关推荐

最新文章

热门文章