Update 0167、0169

leetcode/0169.Majority-Element/169. Majority Element.go

@@ -6,11 +6,12 @@ func majorityElement(nums []int) int {
 	for i := 0; i < len(nums); i++ {
 		if count == 0 {
 			res, count = nums[i], 1
-		}
-		if nums[i] == res {
-			count++
 		} else {
-			count--
+			if nums[i] == res {
+				count++
+			} else {
+				count--
+			}
 		}
 	}
 	return res

website/content/ChapterFour/0100~0199/0167.Two-Sum-II-Input-array-is-sorted.md

@@ -43,13 +43,14 @@ func twoSum167(numbers []int, target int) []int {
 	for i < j {
 		if numbers[i]+numbers[j] == target {
 			return []int{i + 1, j + 1}
-		} else if numbers[i]+numbers[j] < target {
+		}
+		if numbers[i]+numbers[j] < target {
 			i++
 		} else {
 			j--
 		}
 	}
-	return []int{-1, -1}
+	return nil
 }
 
 // 解法二 不管数组是否有序，空间复杂度比上一种解法要多 O(n)
@@ -57,8 +58,8 @@ func twoSum167_1(numbers []int, target int) []int {
 	m := make(map[int]int)
 	for i := 0; i < len(numbers); i++ {
 		another := target - numbers[i]
-		if _, ok := m[another]; ok {
-			return []int{m[another] + 1, i + 1}
+		if idx, ok := m[another]; ok {
+			return []int{idx + 1, i + 1}
 		}
 		m[numbers[i]] = i
 	}

website/content/ChapterFour/0100~0199/0169.Majority-Element.md

@@ -63,6 +63,7 @@ func majorityElement1(nums []int) int {
 	return 0
 }
 
+
 ```