[E:57/533, M:57/974, H:6/387] add No: 151 Reverse Words in a String

Author: gladmo

questions/serial/中等/151/README.md

@@ -0,0 +1,59 @@
+## [翻转字符串里的单词](https://leetcode-cn.com/problems/reverse-words-in-a-string/)
+
+给定一个字符串，逐个翻转字符串中的每个单词。
+
+**说明：**
+
+*   无空格字符构成一个 **单词** 。
+*   输入字符串可以在前面或者后面包含多余的空格，但是反转后的字符不能包括。
+*   如果两个单词间有多余的空格，将反转后单词间的空格减少到只含一个。
+
+ 
+
+**示例 1：**
+
+`**输入：**"`the sky is blue`"
+**输出：**"`blue is sky the`"
+`
+
+**示例 2：**
+
+`**输入：**"  hello world!  "
+**输出：**"world! hello"
+**解释：**输入字符串可以在前面或者后面包含多余的空格，但是反转后的字符不能包括。
+`
+
+**示例 3：**
+
+`**输入：**"a good   example"
+**输出：**"example good a"
+**解释：**如果两个单词间有多余的空格，将反转后单词间的空格减少到只含一个。
+`
+
+**示例 4：**
+
+`**输入：**s = "  Bob    Loves  Alice   "
+**输出：**"Alice Loves Bob"
+`
+
+**示例 5：**
+
+`**输入：**s = "Alice does not even like bob"
+**输出：**"bob like even not does Alice"
+`
+
+ 
+
+**提示：**
+
+*   `1 <= s.length <= 10
+4
+`
+*   `s` 包含英文大小写字母、数字和空格 `' '`
+*   `s` 中 **至少存在一个** 单词
+
+ 
+
+**进阶：**
+
+*   请尝试使用 _O_(1) 额外空间复杂度的原地解法。

questions/serial/中等/151/golang/main.go

@@ -0,0 +1,77 @@
+package main
+
+import (
+	"context"
+	"fmt"
+	"reflect"
+	"time"
+
+	"github.com/gladmo/leetcode/leet"
+	"github.com/gladmo/leetcode/questions/serial/中等/151/golang/solution"
+)
+
+func main() {
+	/*
+
+		"the sky is blue"
+
+	*/
+
+	tests := []struct {
+		name  string
+		input string
+		want  string
+	}{
+		{
+			name:  "test-the sky is blue",
+			input: "the sky is blue",
+			want:  "blue is sky the",
+		},
+		{
+			name:  "test-  hello world!  ",
+			input: "  hello world!  ",
+			want:  "world! hello",
+		},
+		{
+			name:  "test-a good   example",
+			input: "a good   example",
+			want:  "example good a",
+		},
+		{
+			name:  "test-  Bob    Loves  Alice   ",
+			input: "  Bob    Loves  Alice   ",
+			want:  "Alice Loves Bob",
+		},
+		{
+			name:  "test-Alice does not even like bob",
+			input: "Alice does not even like bob",
+			want:  "bob like even not does Alice",
+		},
+	}
+
+	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.input)
+			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/中等/151/golang/solution/reverse-words-in-a-string.go

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

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

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

questions/store.json

@@ -0,0 +1,59 @@
+## [翻转字符串里的单词](https://leetcode-cn.com/problems/reverse-words-in-a-string/)
+
+给定一个字符串，逐个翻转字符串中的每个单词。
+
+**说明：**
+
+*   无空格字符构成一个 **单词** 。
+*   输入字符串可以在前面或者后面包含多余的空格，但是反转后的字符不能包括。
+*   如果两个单词间有多余的空格，将反转后单词间的空格减少到只含一个。
+
+ 
+
+**示例 1：**
+
+`**输入：**"`the sky is blue`"
+**输出：**"`blue is sky the`"
+`
+
+**示例 2：**
+
+`**输入：**"  hello world!  "
+**输出：**"world! hello"
+**解释：**输入字符串可以在前面或者后面包含多余的空格，但是反转后的字符不能包括。
+`
+
+**示例 3：**
+
+`**输入：**"a good   example"
+**输出：**"example good a"
+**解释：**如果两个单词间有多余的空格，将反转后单词间的空格减少到只含一个。
+`
+
+**示例 4：**
+
+`**输入：**s = "  Bob    Loves  Alice   "
+**输出：**"Alice Loves Bob"
+`
+
+**示例 5：**
+
+`**输入：**s = "Alice does not even like bob"
+**输出：**"bob like even not does Alice"
+`
+
+ 
+
+**提示：**
+
+*   `1 <= s.length <= 10
+4
+`
+*   `s` 包含英文大小写字母、数字和空格 `' '`
+*   `s` 中 **至少存在一个** 单词
+
+ 
+
+**进阶：**
+
+*   请尝试使用 _O_(1) 额外空间复杂度的原地解法。

questions/tags/字符串/中等/reverse-words-in-a-string/README.md

@@ -0,0 +1,77 @@
+package main
+
+import (
+	"context"
+	"fmt"
+	"reflect"
+	"time"
+
+	"github.com/gladmo/leetcode/leet"
+	"github.com/gladmo/leetcode/questions/serial/中等/151/golang/solution"
+)
+
+func main() {
+	/*
+
+		"the sky is blue"
+
+	*/
+
+	tests := []struct {
+		name  string
+		input string
+		want  string
+	}{
+		{
+			name:  "test-the sky is blue",
+			input: "the sky is blue",
+			want:  "blue is sky the",
+		},
+		{
+			name:  "test-  hello world!  ",
+			input: "  hello world!  ",
+			want:  "world! hello",
+		},
+		{
+			name:  "test-a good   example",
+			input: "a good   example",
+			want:  "example good a",
+		},
+		{
+			name:  "test-  Bob    Loves  Alice   ",
+			input: "  Bob    Loves  Alice   ",
+			want:  "Alice Loves Bob",
+		},
+		{
+			name:  "test-Alice does not even like bob",
+			input: "Alice does not even like bob",
+			want:  "bob like even not does Alice",
+		},
+	}
+
+	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.input)
+			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/字符串/中等/reverse-words-in-a-string/golang/main.go

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