[E:60/533, M:57/974, H:6/387] add No: 167 Two Sum II - Input array is sorted

Author: gladmo

questions/serial/中等/151/golang/solution/reverse-words-in-a-string.go

@@ -4,7 +4,6 @@ import (
 	"fmt"
 	"os"
 	"runtime/debug"
-	"strings"
 )
 
 func Export(s string) string {
@@ -27,5 +26,5 @@ func Export(s string) string {
 /****************************************************/
 
 func reverseWords(s string) string {
-	strings.Index()
+
 }

questions/serial/简单/167/README.md

@@ -0,0 +1,16 @@
+## [两数之和 II - 输入有序数组](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/)
+
+给定一个已按照**_升序排列_ **的有序数组，找到两个数使得它们相加之和等于目标数。
+
+函数应该返回这两个下标值 __ index1 和 index2，其中 index1 必须小于 index2_。_
+
+**说明:**
+
+*   返回的下标值（index1 和 index2）不是从零开始的。
+*   你可以假设每个输入只对应唯一的答案，而且你不可以重复使用相同的元素。
+
+**示例:**
+
+`**输入:** numbers = [2, 7, 11, 15], target = 9
+**输出:** [1,2]
+**解释:** 2 与 7 之和等于目标数 9 。因此 index1 = 1, index2 = 2 。`

questions/serial/简单/167/golang/main.go

@@ -0,0 +1,84 @@
+package main
+
+import (
+	"context"
+	"fmt"
+	"reflect"
+	"time"
+
+	"github.com/gladmo/leetcode/leet"
+	"github.com/gladmo/leetcode/questions/serial/简单/167/golang/solution"
+)
+
+func main() {
+	/*
+
+			[2,7,11,15]
+		9
+
+	*/
+
+	tests := []struct {
+		name   string
+		input1 []int
+		input2 int
+		want   []int
+	}{
+		{
+			name:   "test-[2,7,11,15]-9",
+			input1: []int{2, 7, 11, 15},
+			input2: 9,
+			want:   []int{1, 2},
+		},
+		{
+			name:   "test-[2,7,11,15]-17",
+			input1: []int{2, 7, 11, 15},
+			input2: 17,
+			want:   []int{1, 4},
+		},
+		{
+			name:   "test-[2,7,11,15]-22",
+			input1: []int{2, 7, 11, 15},
+			input2: 22,
+			want:   []int{2, 4},
+		},
+		{
+			name:   "test-[2,7,11,15]-18",
+			input1: []int{2, 7, 11, 15},
+			input2: 18,
+			want:   []int{2, 3},
+		},
+		{
+			name:   "test-[2,7,11,15]-26",
+			input1: []int{2, 7, 11, 15},
+			input2: 26,
+			want:   []int{3, 4},
+		},
+	}
+
+	testLog := leet.NewTestLog(len(tests))
+	defer testLog.Render()
+
+	timeoutDuration := time.Second * 2
+
+	for idx, test := range tests {
+		// 超时检测
+		got := test.want
+		timeout := leet.Timeout(timeoutDuration, func(ctx context.Context, cancel context.CancelFunc) {
+			got = solution.Export(test.input1, test.input2)
+			cancel()
+		})
+
+		if timeout {
+			testLog.Fail(idx+1, test.name, "timeout")
+			continue
+		}
+
+		if !reflect.DeepEqual(test.want, got) {
+			testLog.Fail(idx+1, test.name, fmt.Sprintf("want: %v, got %v.", test.want, got))
+			continue
+		}
+
+		testLog.Pass(idx+1, test.name)
+	}
+}

questions/serial/简单/167/golang/solution/two-sum-ii-input-array-is-sorted.go

@@ -0,0 +1,30 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+func Export(numbers []int, target int) []int {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", numbers, target)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return twoSum(numbers, target)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func twoSum(numbers []int, target int) []int {
+
+}

questions/serial/简单/167/golang/solution/two-sum-ii-input-array-is-sorted.go.clean

@@ -0,0 +1,30 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+func Export(numbers []int, target int) []int {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", numbers, target)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return twoSum(numbers, target)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func twoSum(numbers []int, target int) []int {
+
+}

questions/store.json

@@ -0,0 +1,16 @@
+## [两数之和 II - 输入有序数组](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/)
+
+给定一个已按照**_升序排列_ **的有序数组，找到两个数使得它们相加之和等于目标数。
+
+函数应该返回这两个下标值 __ index1 和 index2，其中 index1 必须小于 index2_。_
+
+**说明:**
+
+*   返回的下标值（index1 和 index2）不是从零开始的。
+*   你可以假设每个输入只对应唯一的答案，而且你不可以重复使用相同的元素。
+
+**示例:**
+
+`**输入:** numbers = [2, 7, 11, 15], target = 9
+**输出:** [1,2]
+**解释:** 2 与 7 之和等于目标数 9 。因此 index1 = 1, index2 = 2 。`

questions/tags/二分查找/简单/two-sum-ii-input-array-is-sorted/README.md

@@ -0,0 +1,84 @@
+package main
+
+import (
+	"context"
+	"fmt"
+	"reflect"
+	"time"
+
+	"github.com/gladmo/leetcode/leet"
+	"github.com/gladmo/leetcode/questions/serial/简单/167/golang/solution"
+)
+
+func main() {
+	/*
+
+			[2,7,11,15]
+		9
+
+	*/
+
+	tests := []struct {
+		name   string
+		input1 []int
+		input2 int
+		want   []int
+	}{
+		{
+			name:   "test-[2,7,11,15]-9",
+			input1: []int{2, 7, 11, 15},
+			input2: 9,
+			want:   []int{1, 2},
+		},
+		{
+			name:   "test-[2,7,11,15]-17",
+			input1: []int{2, 7, 11, 15},
+			input2: 17,
+			want:   []int{1, 4},
+		},
+		{
+			name:   "test-[2,7,11,15]-22",
+			input1: []int{2, 7, 11, 15},
+			input2: 22,
+			want:   []int{2, 4},
+		},
+		{
+			name:   "test-[2,7,11,15]-18",
+			input1: []int{2, 7, 11, 15},
+			input2: 18,
+			want:   []int{2, 3},
+		},
+		{
+			name:   "test-[2,7,11,15]-26",
+			input1: []int{2, 7, 11, 15},
+			input2: 26,
+			want:   []int{3, 4},
+		},
+	}
+
+	testLog := leet.NewTestLog(len(tests))
+	defer testLog.Render()
+
+	timeoutDuration := time.Second * 2
+
+	for idx, test := range tests {
+		// 超时检测
+		got := test.want
+		timeout := leet.Timeout(timeoutDuration, func(ctx context.Context, cancel context.CancelFunc) {
+			got = solution.Export(test.input1, test.input2)
+			cancel()
+		})
+
+		if timeout {
+			testLog.Fail(idx+1, test.name, "timeout")
+			continue
+		}
+
+		if !reflect.DeepEqual(test.want, got) {
+			testLog.Fail(idx+1, test.name, fmt.Sprintf("want: %v, got %v.", test.want, got))
+			continue
+		}
+
+		testLog.Pass(idx+1, test.name)
+	}
+}

questions/tags/二分查找/简单/two-sum-ii-input-array-is-sorted/golang/main.go

@@ -0,0 +1,30 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+func Export(numbers []int, target int) []int {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", numbers, target)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return twoSum(numbers, target)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func twoSum(numbers []int, target int) []int {
+
+}

questions/tags/二分查找/简单/two-sum-ii-input-array-is-sorted/golang/solution/two-sum-ii-input-array-is-sorted.go

@@ -0,0 +1,30 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+func Export(numbers []int, target int) []int {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", numbers, target)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return twoSum(numbers, target)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func twoSum(numbers []int, target int) []int {
+
+}