2015年8月15日
LeetCode:Majority Element Ⅱ
摘要： 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) space.解法一... 阅读全文
posted @ 2015-08-15 11:07 尾巴草 阅读(125) 评论(0) 推荐(0)