LeetCode 229. Majority Element II(众数II)
原题网址:https://leetcode.com/problems/majority-element-ii/Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1
原创
2016-04-05 06:28:28 ·
1747 阅读 ·
0 评论