[leetcode 169. Majority Element]easy |week4
2017-03-19 11:20
344 查看
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.
You may assume that the array is non-empty and the majority element always exist in the array.
一·题目分析
题目的目的就是找数组中出现次数超过[n/2]的数,也假设了数组一定存在这样的数。想要找到这样的数,只需要遍历一次就可以了,每找出两个不同的element,就成对删除即count–,最终剩下的一定就是所求的。二、代码
class Solution { public: int majorityElement(vector<int> &num) { int element = 0; int count = 0; for(int i = 0; i < num.size(); i++) { if(count == 0) { element = num[i]; count = 1; } else { if(element == num[i]) count++; else count--; } } return element; } };
三、总结
这是一道比较简单的题目,思路也很清晰,一看就能知道该如何去找相关文章推荐
- Leetcode 169. Majority Element (Easy) (cpp)
- 【LeetCode】169. Majority Element(Easy)解题报告
- Leetcode解题笔记 169.Majority Element [Easy]
- [Leetcode 169, Easy] Majority Element
- Leetcode 169. Majority Element[easy]
- 【LeetCode】169.Majority Element (Easy)
- LeetCode 169. Majority Element (Easy)
- LeetCode 169. Majority Element (Easy)
- [LeetCode练习题-C语言]169. Majority Element
- 【Leetcode】169. Majority Element
- leetcode 169: Majority Element
- LeetCode 169. Majority Element (数组的主要元素、摩尔投票算法)
- LeetCode - 169. Majority Element
- LeetCode 169. Majority Element
- LeetCode 169. Majority Element (众数)
- [LeetCode]169. Majority Element
- leetcode 169. Majority Element | 摩尔投票法
- LeetCode 169. Majority Element(Java)
- leetcode 169 Majority Element 冰山查询
- 小白笔记-------------------------------leetcode(169. Majority Element)