Add solution and README for problem 169

Author: 0xff-dev

leetcode/101-200/0169.Majority-Element/README.md

@@ -0,0 +1,27 @@
+# [169.Majority Element][title]
+
+## Description
+Given an array `nums` of size `n`, return the majority element.
+
+The majority element is the element that appears more than `⌊n / 2⌋` times. You may assume that the majority element always exists in the array.
+
+**Example 1:**
+
+```
+Input: nums = [3,2,3]
+Output: 3
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,2,1,1,1,2,2]
+Output: 2
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/majority-element/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/101-200/0169.Majority-Element/Solution.go

@@ -49,3 +49,20 @@ func majorityElement_3(nums []int) int {
 
 return majorityElement_3(numsTmp)
 }
+
+func majorityElement_4(nums []int) int {
+times := 1
+target := nums[0]
+for idx := 1; idx < len(nums); idx++ {
+if nums[idx] == target {
+times++
+continue
+}
+times--
+if times == 0 {
+target = nums[idx]
+times = 1
+}
+}
+return target
+}

leetcode/101-200/0169.Majority-Element/Solution_test.go

@@ -17,6 +17,7 @@ var SolutionFuncList = []SolutionFuncType{
 majorityElement_1,
 majorityElement_2,
 majorityElement_3,
+majorityElement_4,
 }
 
 // Test case info struct