Categorygithub.com/frankegoesdown/leetcode-in-goAlgorithms0229.majority-element-ii
package
0.0.0-20190725034537-db5e768ce8c3
Repository: https://github.com/frankegoesdown/leetcode-in-go.git
Documentation: pkg.go.dev
Overview
Versions
1
Dependencies
0
Dependents
0
Files
45 SLOC

# README

229. 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) space.

解题思路

见程序注释