169. Majority Element
2017-03-05 21:42
106 查看
class Solution {
public:
int majorityElement(vector<int>& nums) {
int major=nums[0], count = 1;
for(int i=1; i<nums.size();i++){
if(count==0){
count++;
major=nums[i];
}else if(major==nums[i]){
count++;
}else count--;
}
return major;
}
};
public:
int majorityElement(vector<int>& nums) {
int major=nums[0], count = 1;
for(int i=1; i<nums.size();i++){
if(count==0){
count++;
major=nums[i];
}else if(major==nums[i]){
count++;
}else count--;
}
return major;
}
};
相关文章推荐
- leetcode[169] Majority Element
- OJ 169 Majority Element
- LeetCode 169. Majority Element
- (LeetCode 169) Majority Element
- LeetCode169:Majority Element
- [leedcode 169] Majority Element
- 2018.03.07 leetcode 打卡 #169. Majority Element
- 2018.03.07 leetcode 打卡 #169. Majority Element
- [leetcode] Add to List 169. Majority Element
- [LeetCode] 169. Majority Element
- LeetCode 169. Majority Element and LeetCode 229. Majority Element II解题报告
- Leetcode:169. Majority Element
- [LeetCode] Algorithms-169. Majority Element
- 169. Majority Element
- 15算法课程 169. Majority Element
- leetcode 169 Majority Element 冰山查询
- [leetcode]#169. Majority Element
- 169. Majority Element
- 169. Majority Element
- [leetcode] 169. Majority Element