Commit 5c20595

committed

Merge pull request #391 from 0xff-dev/290

Add solution and test-cases for problem 290

2 parents 99ec36a + 8692df9 commit 5c20595Copy full SHA for 5c20595

File tree

+57

-26

lines changed

+57

-26

lines changed

Lines changed: 15 additions & 13 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,28 +1,30 @@`
`1`	`1`	`# [290.Word Pattern][title]`
`2`	`2`
`3`		`-> [!WARNING\|style:flat]`
`4`		`-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)`
`5`		`-`
`6`	`3`	`## Description`
	`4`	+Given a `pattern` and a string `s`, find if `s` follows the same pattern.
	`5`	`+`
	`6`	+Here follow means a full match, such that there is a bijection between a letter in `pattern` and a non-empty word in `s`.
`7`	`7`
`8`	`8`	`Example 1:`
`9`	`9`
`10`	`10`	```
`11`		`-Input: a = "11", b = "1"`
`12`		`-Output: "100"`
	`11`	`+Input: pattern = "abba", s = "dog cat cat dog"`
	`12`	`+Output: true`
`13`	`13`	```
`14`	`14`
`15`		`-## 题意`
`16`		`-> ...`
	`15`	`+Example 2:`
`17`	`16`
`18`		`-## 题解`
`19`		`-`
`20`		`-### 思路1`
`21`		`-> ...`
`22`		`-Word Pattern`
`23`		-```go
	`17`	+```
	`18`	`+Input: pattern = "abba", s = "dog cat cat fish"`
	`19`	`+Output: false`
`24`	`20`	```
`25`	`21`
	`22`	`+Example 3:`
	`23`	`+`
	`24`	+```
	`25`	`+Input: pattern = "aaaa", s = "dog cat cat dog"`
	`26`	`+Output: false`
	`27`	+```
`26`	`28`
`27`	`29`	`## 结语`
`28`	`30`

Lines changed: 30 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,33 @@`
`1`	`1`	`package Solution`
`2`	`2`
`3`		`-func Solution(x bool) bool {`
`4`		`- return x`
	`3`	`+import "strings"`
	`4`	`+`
	`5`	`+func Solution(pattern string, s string) bool {`
	`6`	`+ words := strings.Split(s, " ")`
	`7`	`+ if len(words) != len(pattern) {`
	`8`	`+ return false`
	`9`	`+ }`
	`10`	`+ b2w := make(map[byte]string)`
	`11`	`+ w2b := make(map[string]byte)`
	`12`	`+ b, w := pattern[0], words[0]`
	`13`	`+ b2w[b] = w`
	`14`	`+ w2b[w] = b`
	`15`	`+`
	`16`	`+ for i := 1; i < len(pattern); i++ {`
	`17`	`+ if pattern[i] == b {`
	`18`	`+ if words[i] != w {`
	`19`	`+ return false`
	`20`	`+ }`
	`21`	`+ continue`
	`22`	`+ }`
	`23`	`+ b, w = pattern[i], words[i]`
	`24`	`+ v, ok := b2w[pattern[i]]`
	`25`	`+ v1, ok1 := w2b[words[i]]`
	`26`	`+ if (ok && words[i] != v) \|\| (ok1 && pattern[i] != v1) {`
	`27`	`+ return false`
	`28`	`+ }`
	`29`	`+ b2w[b] = w`
	`30`	`+ w2b[w] = b`
	`31`	`+ }`
	`32`	`+ return true`
`5`	`33`	`}`

Lines changed: 12 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -9,31 +9,32 @@ import (`
`9`	`9`	`func TestSolution(t *testing.T) {`
`10`	`10`	`// 测试用例`
`11`	`11`	`cases := []struct {`
`12`		`- name string`
`13`		`- inputsbool`
`14`		`- expect bool`
	`12`	`+ name string`
	`13`	`+ pattern, sstring`
	`14`	`+ expect bool`
`15`	`15`	`}{`
`16`		`- {"TestCase", true, true},`
`17`		`- {"TestCase", true, true},`
`18`		`- {"TestCase", false, false},`
	`16`	`+ {"TestCase1", "abba", "dog cat cat dog", true},`
	`17`	`+ {"TestCase2", "abba", "dog cat cat fish", false},`
	`18`	`+ {"TestCase3", "aaaa", "dog cat cat dog", false},`
	`19`	`+ {"TestCase4", "abba", "dog dog dog dog", false},`
`19`	`20`	`}`
`20`	`21`
`21`	`22`	`// 开始测试`
`22`	`23`	`for i, c := range cases {`
`23`	`24`	`t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {`
`24`		`- got := Solution(c.inputs)`
	`25`	`+ got := Solution(c.pattern, c.s)`
`25`	`26`	`if !reflect.DeepEqual(got, c.expect) {`
`26`		`- t.Fatalf("expected: %v, but got: %v, with inputs: %v",`
`27`		`- c.expect, got, c.inputs)`
	`27`	`+ t.Fatalf("expected: %v, but got: %v, with inputs: %v %v",`
	`28`	`+ c.expect, got, c.pattern, c.s)`
`28`	`29`	`}`
`29`	`30`	`})`
`30`	`31`	`}`
`31`	`32`	`}`
`32`	`33`
`33`		`-//压力测试`
	`34`	`+//压力测试`
`34`	`35`	`func BenchmarkSolution(b *testing.B) {`
`35`	`36`	`}`
`36`	`37`
`37`		`-//使用案列`
	`38`	`+//使用案列`
`38`	`39`	`func ExampleSolution() {`
`39`	`40`	`}`

Comments

(0)