229 accepted

Author: aQua

Algorithms/0229.majority-element-ii/README.md

@@ -0,0 +1,8 @@
+# [229. Majority Element II](https://leetcode.com/problems/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.
+
+## 解题思路
+
+见程序注释

Algorithms/0229.majority-element-ii/majority-element-ii.go

@@ -0,0 +1,23 @@
+package Problem0229
+
+func majorityElement(a []int) []int {
+	l := len(a)
+	if l < 2 {
+		return a
+	}
+
+	res := []int{}
+	rec := make(map[int]int, l)
+
+	for i := 0; i < l; i++ {
+		rec[a[i]]++
+	}
+
+	for k, n := range rec {
+		if 3*n > l {
+			res = append(res, k)
+		}
+	}
+
+	return res
+}

Algorithms/0229.majority-element-ii/majority-element-ii_test.go

@@ -0,0 +1,57 @@
+package Problem0229
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type question struct {
+	para
+	ans
+}
+
+// para 是参数
+type para struct {
+	nums []int
+}
+
+// ans 是答案
+type ans struct {
+	one []int
+}
+
+func Test_Problem0229(t *testing.T) {
+	ast := assert.New(t)
+
+	qs := []question{
+
+		question{
+			para{
+				[]int{1, 1, 1, 2, 2, 3, 3, 3},
+			},
+			ans{
+				[]int{1, 3},
+			},
+		},
+
+		question{
+			para{
+				[]int{1, 3},
+			},
+			ans{
+				[]int{1, 3},
+			},
+		},
+
+		// 如需多个测试，可以复制上方元素。
+	}
+
+	for _, q := range qs {
+		a, p := q.ans, q.para
+		fmt.Printf("~~%v~~\n", p)
+
+		ast.Equal(a.one, majorityElement(p.nums), "输入:%v", p)
+	}
+}