首页 > 代码库 > LeetCode "Majority Element"
LeetCode "Majority Element"
Really interesting O(n) problem. Just like playing.. so actually working on algorithm problems is like playing games!
class Solution {public: int majorityElement(vector<int> &num) { int ret = num[0]; int cnt = 1; for (int i = 1; i < num.size(); i ++) { if (cnt == 0) ret = num[i]; if(num[i] == ret) cnt ++; else cnt--; } return ret; }};
LeetCode "Majority Element"
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。