Skip to content

Files

Latest commit

aQuaaQua
aQua
and
aQua
Aug 28, 2017
ce08416 · Aug 28, 2017

History

History

0229.majority-element-ii

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Aug 28, 2017
Aug 28, 2017
Aug 28, 2017

题目

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.

解题思路

见程序注释