169 accepted

Author: aQua

Algorithms/0169.majority-element/README.md

@@ -0,0 +1,12 @@
+# [169. Majority Element](https://leetcode.com/problems/majority-element/)
+
+## 题目
+
+Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.
+
+You may assume that the array is non-empty and the majority element always exist in the array.
+
+## 解题思路
+
+
+见程序注释

Algorithms/0169.majority-element/majority-element.go

@@ -0,0 +1,24 @@
+package Problem0169
+
+func majorityElement(nums []int) int {
+	n := len(nums)
+	times := n / 2
+	m := make(map[int]int, times)
+
+	for _, n := range nums {
+		if m[n]+1 > times {
+			return n
+		}
+		m[n]++
+	}
+
+	max, res := 0, 0
+	for i, v := range m {
+		if max < v {
+			max = v
+			res = i
+		}
+	}
+
+	return res
+}

Algorithms/0169.majority-element/majority-element_test.go

@@ -0,0 +1,65 @@
+package Problem0169
+
+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_Problem0169(t *testing.T) {
+	ast := assert.New(t)
+
+	qs := []question{
+
+		question{
+			para{
+				[]int{1},
+			},
+			ans{
+				1,
+			},
+		},
+		
+		question{
+			para{
+				[]int{1, 1, 2, 2},
+			},
+			ans{
+				1,
+			},
+		},
+		question{
+			para{
+				[]int{1, 2, 2},
+			},
+			ans{
+				2,
+			},
+		},
+
+		// 如需多个测试，可以复制上方元素。
+	}
+
+	for _, q := range qs {
+		a, p := q.ans, q.para
+		fmt.Printf("~~%v~~\n", p)
+
+		ast.Equal(a.one, majorityElement(p.nums), "输入:%v", p)
+	}
+}