Leetcode#169 Majority Element
2015-01-26 20:28
393 查看
原题地址
寻找主元素
非常巧妙的方法
代码:
寻找主元素
非常巧妙的方法
代码:
int majorityElement(vector<int> &num) { int candidate = 0; int count = 0; for (int i = 0; i < num.size(); i++) { if (count == 0) { candidate = num[i]; count = 1; } else count += candidate == num[i] ? 1 : -1; } return candidate; }
相关文章推荐
- 小白笔记-------------------------------leetcode(169. Majority Element)
- Leetcode 169. Majority Element
- LeetCode 169. Majority Element
- LeetCode.169(229) Majority Element && II
- leetcode-169-Majority Element
- LeetCode-Array-169. Majority Element
- Leetcode169: Majority Element
- [leetcode] 169.Majority Element
- 【LeetCode-169】Majority Element
- leetcode解题方案--169--majority element
- 【Leetcode】169. Majority Element
- [leetcode] 169. Majority Element
- 2018.03.07 leetcode 打卡 #169. Majority Element
- LeetCode 169. Majority Element
- [LeetCode169]Majority Element求一个数组中出现次数大于n/2的数
- LeetCode 169. Majority Element
- leetcode【169 Majority Element】【Python】
- LeetCode 169. Majority Element (数组的主要元素、摩尔投票算法)
- Leetcode-169. Majority Element
- leetcode169---Majority Element(数组中出现次数超过一半的数)