Leetcode Majority Element
来源:互联网 发布:nginx lua ddos 编辑:程序博客网 时间:2024/06/11 10:15
**题目:**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
解题思路: 题目要寻找数组中出现次数超过 ⌊ n/2 ⌋ 次的元素,而且结果一定存在。那么可以选择一次的扫描整个数组,遇到不同的就把它们成对删除,还是相同的就把一个计数器加一,那么扫描完整个数组后,最后就能够得到所要的答案。
int majorityElement(vector<int>& nums) { int ans=0; int count=0; for(int i=0;i<nums.size();i++) { if(count==0) { ans=nums[i]; count++; } else { if(nums[i]==ans) count++; else count--; } } return ans; }
0 0
- 【leetcode】Majority Element II,Majority element algorithm
- Leetcode: Majority Element &Majority Element II
- Leetcode Majority Element
- leetcode 169-Majority Element
- 【leetcode 哈希表】Majority Element
- LeetCode:Majority Element
- leetcode:Majority Element
- leetcode: Majority Element
- [LeetCode] Majority Element
- leetcode 153: Majority Element
- leetcode Majority Element
- LeetCode:Majority Element
- leetcode:Majority Element
- [LeetCode] Majority Element
- Leetcode-Majority Element
- [leetcode]Majority Element
- [LeetCode]Majority Element
- Leetcode: Majority Element
- 原码、反码和补码
- boilerplate/starter kit/best practice
- 如何找出数组中第二大的数
- C陷阱与缺陷学习笔记
- PHP页面静态化技术(备忘)
- Leetcode Majority Element
- java 序列化和反序列化
- hadoop分布式搭建的测试
- POJ-1852-想法
- php之微信开发(获取用户信息)
- 初探微信摇一摇周边与iBeacon
- Struts学习笔记---拦截器
- Servlet用户登陆过滤器,编码校验过滤器
- PHP页面静态化