导航

2015年8月6日

(medium)LeetCode 229.Majority Element II

摘要： Given an integer array of sizen, 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-06 22:45 骄阳照林 阅读(134) 评论(0) 推荐(0) 编辑