首页 > 代码库 > [LintCode] Majority Number 求众数
[LintCode] Majority Number 求众数
Given an array of integers, the majority number is the number that occurs more than half
of the size of the array. Find it.
Notice
You may assume that the array is non-empty and the majority number always exist in the array.
Have you met this question in a real interview?
Example
Given [1, 1, 1, 1, 2, 2, 2]
, return 1
Challenge
O(n) time and O(1) extra space
LeetCode上的原题,请参见我之前的博客Majority Element。
解法一:
class Solution {public: /** * @param nums: A list of integers * @return: The majority number */ int majorityNumber(vector<int> nums) { int res = 0, cnt = 0; for (int num : nums) { if (cnt == 0) {res = num; ++cnt;} else (num == res) ? ++cnt : --cnt; } return res; }};
解法二:
class Solution {public: /** * @param nums: A list of integers * @return: The majority number */ int majorityNumber(vector<int> nums) { int res = 0; for (int i = 0; i < 32; ++i) { int ones = 0, zeros = 0; for (int num : nums) { if ((num & (1 << i)) != 0) ++ones; else ++zeros; } if (ones > zeros) res |= (1 << i); } return res; }};
[LintCode] Majority Number 求众数
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。