LeetCode - Majority Element
2015-03-29 22:42
225 查看
参考了别人的想法,思路简洁,效率高。虽然是在充分理解别人的思路后写出的代码,但是还是发现了自己的不足之处。以后还是要多思考多写。加油吧!
public class Solution { public int majorityElement(int[] num) { int ans = 0, cnt = 0; for(int i=0; i<num.length; i++) { if(cnt == 0) { ans = num[i]; cnt ++; } else { if(ans == num[i]) { cnt ++; } else { cnt --; } } } return ans; } }
相关文章推荐
- [LeetCode]169. Majority Element
- leetcode majority element
- leetcode229-Majority Element II(数组中出现最多的数II)
- leetcode记录 169. Majority Element
- [leetcode]Majority Element
- [LeetCode 153] Majority Element
- leetcode Majority Element
- [Leetcode,python] Majority Element 众数
- [leetcode] 169. Majority Element
- Leetcode 169, 229 Majority element
- LeetCode 169. Majority Element
- leetcode169 Majority Element
- LeetCode Majority Element
- LeetCode笔记:169. Majority Element
- LeetCode Problem No'169 Majority Element
- 算法系列(13) Leetcode 169 Majority Element
- LeetCode-Array-169. Majority Element
- LeetCode Devide & Conquer Problem || Majority Element
- Leetcode #169 Majority Element
- LeetCode - Majority Element