feat: commit solution 167

Author: lxlxw

_sidebar.md

@@ -23,6 +23,7 @@
   - [88.合并两个有序数组](solution/1-99/0088.merge-sorted-array/)
   - [118.杨辉三角](solution/100-199/0118.pascals-triangle/)
   - [125.验证回文串](solution/100-199/0125.valid-palindrome/)
+  - [167.两数之和 II - 输入有序数组](solution/100-199/0167.two-sum-ii-input-array-is-sorted/)
   - [169.多数元素](solution/100-199/0169.majority-element/)
   - [217.存在重复元素](solution/200-299/0217.contains-duplicate/)
   - [219.存在重复元素 II](solution/200-299/0219.contains-duplicate-ii/)

index-tags.md

@@ -13,6 +13,7 @@
 |  [66](https://leetcode-cn.com/problems/plus-one)  |  [加一](/solution/1-99/0066.plus-one/)  |  `数组`  |  <font color=green>简单</font>  |✅ |
 |  [88](https://leetcode-cn.com/problems/merge-sorted-array)  |  [合并两个有序数组](/solution/1-99/0088.merge-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [118](https://leetcode-cn.com/problems/pascals-triangle)  |  [杨辉三角](/solution/100-199/0118.pascal%27s-triangle/)  |  `数组`  |  <font color=green>简单</font>  |✅ |
+|  [167](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted)  |  [两数之和 ii - 输入有序数组](/solution/100-199/0167.two-sum-ii---input-array-is-sorted/)  |  `数组`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 |  [169](https://leetcode-cn.com/problems/majority-element)  |  [多数元素](/solution/100-199/0169.majority-element/)  |  `位运算`,`数组`,`分治算法`  |  <font color=green>简单</font>  |✅ |
 |  [217](https://leetcode-cn.com/problems/contains-duplicate)  |  [存在重复元素](/solution/200-299/0217.contains-duplicate/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |
 |  [219](https://leetcode-cn.com/problems/contains-duplicate-ii)  |  [存在重复元素 ii](/solution/200-299/0219.contains-duplicate-ii/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |
@@ -61,8 +62,10 @@
 |  [28](https://leetcode-cn.com/problems/implement-strstr)  |  [实现 strstr()](/solution/1-99/0028.implement-strstr%28%29/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [88](https://leetcode-cn.com/problems/merge-sorted-array)  |  [合并两个有序数组](/solution/1-99/0088.merge-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [125](https://leetcode-cn.com/problems/valid-palindrome)  |  [验证回文串](/solution/100-199/0125.valid-palindrome/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
+|  [167](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted)  |  [两数之和 ii - 输入有序数组](/solution/100-199/0167.two-sum-ii---input-array-is-sorted/)  |  `数组`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 |  [283](https://leetcode-cn.com/problems/move-zeroes)  |  [移动零](/solution/200-299/0283.move-zeroes/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 
+
 #### **链表**
 
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
@@ -75,6 +78,7 @@
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
 |  [35](https://leetcode-cn.com/problems/search-insert-position)  |  [搜索插入位置](/solution/1-99/0035.search-insert-position/)  |  `数组`,`二分查找`  |  <font color=green>简单</font>  |✅ |
+|  [167](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted)  |  [两数之和 ii - 输入有序数组](/solution/100-199/0167.two-sum-ii---input-array-is-sorted/)  |  `数组`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 
 #### **排序**
 

index-type.md

@@ -45,7 +45,7 @@
 |  [155](https://leetcode-cn.com/problems/min-stack)  |  [最小栈](/solution/100-199/0155.min-stack/)  |  `栈`,`设计`  |  <font color=green>简单</font>  |
 |  [157](https://leetcode-cn.com/problems/read-n-characters-given-read4)  |  [用 read4 读取 n 个字符](/solution/100-199/0157.read-n-characters-given-read4/)  |  `字符串`  |  <font color=green>简单</font>  |
 |  [160](https://leetcode-cn.com/problems/intersection-of-two-linked-lists)  |  [相交链表](/solution/100-199/0160.intersection-of-two-linked-lists/)  |  `链表`  |  <font color=green>简单</font>  |
-|  [167](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted)  |  [两数之和 ii - 输入有序数组](/solution/100-199/0167.two-sum-ii---input-array-is-sorted/)  |  `数组`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |
+|  [167](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted)  |  [两数之和 ii - 输入有序数组](/solution/100-199/0167.two-sum-ii---input-array-is-sorted/)  |  `数组`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 |  [168](https://leetcode-cn.com/problems/excel-sheet-column-title)  |  [excel表列名称](/solution/100-199/0168.excel-sheet-column-title/)  |  `数学`  |  <font color=green>简单</font>  |
 |  [169](https://leetcode-cn.com/problems/majority-element)  |  [多数元素](/solution/100-199/0169.majority-element/)  |  `位运算`,`数组`,`分治算法`  |  <font color=green>简单</font>  |✅ |
 |  [170](https://leetcode-cn.com/problems/two-sum-iii-data-structure-design)  |  [两数之和 iii - 数据结构设计](/solution/100-199/0170.two-sum-iii---data-structure-design/)  |  `设计`,`哈希表`  |  <font color=green>简单</font>  |

solution/100-199/0167.two-sum-ii-input-array-is-sorted/README.md

@@ -0,0 +1,53 @@
+# [167.两数之和 II - 输入有序数组](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/description/)
+
+
+### 题目描述
+
+<div class="notranslate"><p>给定一个已按照<strong><em>升序排列</em>&nbsp;</strong>的有序数组，找到两个数使得它们相加之和等于目标数。</p>
+
+<p>函数应该返回这两个下标值<em> </em>index1 和 index2，其中 index1&nbsp;必须小于&nbsp;index2<em>。</em></p>
+
+<p><strong>说明:</strong></p>
+
+<ul>
+	<li>返回的下标值（index1 和 index2）不是从零开始的。</li>
+	<li>你可以假设每个输入只对应唯一的答案，而且你不可以重复使用相同的元素。</li>
+</ul>
+
+<p><strong>示例:</strong></p>
+
+<pre><strong>输入:</strong> numbers = [2, 7, 11, 15], target = 9
+<strong>输出:</strong> [1,2]
+<strong>解释:</strong> 2 与 7 之和等于目标数 9 。因此 index1 = 1, index2 = 2 。</pre>
+</div>
+
+### 解题思路
+
+1. 双指针
+
+### 代码实现
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+func twoSum(numbers []int, target int) []int {
+	left := 0
+	right := len(numbers) - 1
+	for left != right {
+		if numbers[left]+numbers[right] == target {
+			break
+		}
+		if numbers[left]+numbers[right] > target {
+			right--
+		}
+		if numbers[left]+numbers[right] < target {
+			left++
+		}
+	}
+	return []int{left + 1, right + 1}
+}
+```
+
+
+<!-- tabs:end -->

solution/100-199/0167.two-sum-ii-input-array-is-sorted/solution.go

@@ -0,0 +1,27 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=167 lang=golang
+ *
+ * [167] 两数之和 II - 输入有序数组
+ */
+
+// @lc code=start
+func twoSum(numbers []int, target int) []int {
+	left := 0
+	right := len(numbers) - 1
+	for left != right {
+		if numbers[left]+numbers[right] == target {
+			break
+		}
+		if numbers[left]+numbers[right] > target {
+			right--
+		}
+		if numbers[left]+numbers[right] < target {
+			left++
+		}
+	}
+	return []int{left + 1, right + 1}
+}
+
+// @lc code=end

solution/100-199/0167.two-sum-ii-input-array-is-sorted/solution_test.go

@@ -0,0 +1,32 @@
+package leetcode
+
+import (
+	"testing"
+)
+
+func TestTwoSum(t *testing.T) {
+
+	var target int
+	var nums []int
+	var ret []int
+
+	nums = []int{2, 7, 11, 15}
+	target = 9
+	ret = []int{1, 2}
+
+	for k, v := range twoSum(nums, target) {
+		if v != ret[k] {
+			t.Fatalf("case fails: %v\n", ret)
+		}
+	}
+
+	nums = []int{2, 7, 11, 15}
+	target = 13
+	ret = []int{1, 3}
+
+	for k, v := range twoSum(nums, target) {
+		if v != ret[k] {
+			t.Fatalf("case fails: %v\n", ret)
+		}
+	}
+}