leetcode之majority number
来源:互联网 发布:基督教网络诗歌116首全 编辑:程序博客网 时间:2024/05/08 12:40
题目:
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.
解答:
典型的摩尔投票,由题意可知,最多还有一个主元素,直接进行摩尔投票即可
class Solution {
public:
int majorityElement(vector<int>& nums) {
int size = nums.size();
int res = 0;
int cnt = 0;
for(int i = 0;i < size;++i)
{
if(cnt == 0)
{
res = nums[i];
cnt++;
}
else
{
if(res == nums[i])
cnt++;
else
cnt--;
}
}
return res;
}
};
- leetcode之majority number
- LeetCode(169) Majority Number
- leetcode之majority element
- LeetCode之Majority Element
- leetcode之Majority Element
- leetcode之Majority Element
- LeetCode之Majority Element
- lincode之Majority Number III
- LeetCode之Majority Element II
- leetcode之Majority Element II
- leetcode之Majority Element II
- leetcode之169. Majority Element
- Leetcode之Majority Element 问题
- Majority Number
- Majority Number
- LeetCode之路:169. Majority Element
- [LeetCode] 分治法学习之 Majority Element
- LintCode:Majority Number / Majority Number II / Majority Number III
- 深入理解SELECT ... LOCK IN SHARE MODE和SELECT ... FOR UPDATE
- Hadoop-MapReduce过程
- The Django Book 2.0--中文版--第九章 模板高级进阶
- 为什么要使用SLF4J而不是Log4J
- 题目1214:丑数
- leetcode之majority number
- Java IO流(1)
- The Django Book 2.0--中文版--第十章: 数据模型高级进阶
- SlidingMenu侧滑菜单 两个jar包的导入
- TextView最大长度限制,超出部分省略号显示
- 264 Ugly Number II
- 钱小写转大写 VB
- 视频通话开发(一)
- Dalvik切换到ART时内存地址对齐问题的分析(1)