167 accepted and finish

Author: aQua

Algorithms/0167.two-sum-ii-input-array-is-sorted/README.md

@@ -0,0 +1,19 @@
+# [167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
+
+## 题目
+
+Given an array of integers that is already sorted `in ascending order`, find two numbers such that they add up to a specific target number.
+
+The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
+
+You may assume that each input would have exactly one solution and you may not use the same element twice.
+
+```
+**Input:*** numbers={2, 7, 11, 15}, target=9
+***Output:*** index1=1, index2=2
+```
+      
+
+## 解题思路
+
+参考 [1.Two Sum](./Algorithms/0001.two-sum)

Algorithms/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.go

@@ -0,0 +1,14 @@
+package Problem0167
+
+func twoSum(nums []int, target int) []int {
+	m := make(map[int]int, len(nums))
+
+	for i, n := range nums {
+		if m[target-n] != 0 {
+			return []int{m[target-n], i + 1}
+		}
+		m[n] = i + 1
+	}
+
+	return nil
+}

Algorithms/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted_test.go

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