290 accepted.

Author: aQua

Algorithms/0290.word-pattern/README.md

@@ -0,0 +1,25 @@
+# [290. Word Pattern](https://leetcode.com/problems/word-pattern/)
+
+## 题目
+
+Given a pattern and a string str, find if str follows the same pattern.
+
+Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.
+
+Examples:
+
+```text
+pattern = "abba", str = "dog cat cat dog" should return true.
+pattern = "abba", str = "dog cat cat fish" should return false.
+pattern = "aaaa", str = "dog cat cat dog" should return false.
+pattern = "abba", str = "dog dog dog dog" should return false.
+```
+
+Notes:
+You may assume pattern contains only lowercase letters, and str contains lowercase letters separated by a single space.
+
+Credits:Special thanks to @minglotus6 for adding this problem and creating all test cases.
+
+## 解题思路
+
+见程序注释

Algorithms/0290.word-pattern/word-pattern.go

@@ -0,0 +1,32 @@
+package Problem0290
+
+import (
+	"strings"
+)
+
+func wordPattern(pattern string, str string) bool {
+	ps := strings.Split(pattern, "")
+	ss := strings.Split(str, " ")
+	if len(ps) != len(ss) {
+		return false
+	}
+	return match(ps, ss) && match(ss, ps)
+}
+
+func match(s1, s2 []string) bool {
+	size := len(s1)
+	m := make(map[string]string, size)
+	var i int
+	var w string
+	var ok bool
+	for i = 0; i < size; i++ {
+		if w, ok = m[s1[i]]; ok {
+			if w != s2[i] {
+				return false
+			}
+		} else {
+			m[s1[i]] = s2[i]
+		}
+	}
+	return true
+}

Algorithms/0290.word-pattern/word-pattern_test.go

@@ -0,0 +1,41 @@
+package Problem0290
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	pattern string
+	str     string
+	ans     bool
+}{
+
+	{"abba", "dog cat cat dog", true},
+	{"abba", "dog cat cat fish", false},
+	{"aaaa", "dog cat cat dog", false},
+	{"abba", "dog dog dog dog", false},
+	{"aaa", "aa aa aa aa", false},
+
+	// 可以有多个 testcase
+}
+
+func Test_wordPattern(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		ast.Equal(tc.ans, wordPattern(tc.pattern, tc.str), "输入:%v", tc)
+	}
+}
+
+func Benchmark_wordPattern(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			wordPattern(tc.pattern, tc.str)
+		}
+	}
+}