169. Majority Element
2016-10-10 09:18
127 查看
class Solution { public: int majorityElement(vector<int>& nums) { if(nums.size()==0) return -1; int majority=nums[0]; int count=1; int n=nums.size(); for(int i=1;i<n;i++) { if(nums[i]==majority) { count++; } else { count--; if(count==0) { count=1; majority=nums[i]; } } } count=0; for(int i=0;i<n;i++) { if(nums[i]==majority) { count++; } } if(count>n/2) { return majority; } return -1; } };
相关文章推荐
- 169. Majority Element。
- 2018.03.07 leetcode 打卡 #169. Majority Element
- 169. Majority Element
- [LeetCode]169. Majority Element
- 【leetcode】【169】Majority Element
- 169. Majority Element
- 【Leetcode】:169. Majority Element 问题 in Go语言
- Leetcode 169. Majority Element
- 169. Majority Element
- LeetCode 169 Majority Element
- leetcode-169. Majority Element 寻找众数,hash方法
- 169. Majority Element
- 169. Majority Element
- LeetCode:169. Majority Element
- 169. Majority Element
- 169. Majority Element
- LeetCode 169. Majority Element解题方法
- Leetcode#169. Majority Element(四种解法)
- OJ 169 Majority Element
- Leetcode 169.Majority Element