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-10-02 22:06 Draug 阅读(147) 评论(0) 推荐(0) 编辑