(pattern, s)
| 3 | // space complexity O(n) |
| 4 | |
| 5 | var wordPattern = function (pattern, s) { |
| 6 | s = s.split(' '); |
| 7 | |
| 8 | if (s.length !== pattern.length) return false; |
| 9 | |
| 10 | wordToChar = new Map(); |
| 11 | charToWord = new Map(); |
| 12 | |
| 13 | for (let i = 0; i < pattern.length; i++) { |
| 14 | wordToChar.set(s[i], pattern[i]); |
| 15 | charToWord.set(pattern[i], s[i]); |
| 16 | } |
| 17 | |
| 18 | for (let i = 0; i < pattern.length; i++) { |
| 19 | if ( |
| 20 | charToWord.get(pattern[i]) !== s[i] || |
| 21 | pattern[i] !== wordToChar.get(s[i]) |
| 22 | ) { |
| 23 | return false; |
| 24 | } |
| 25 | } |
| 26 | |
| 27 | return true; |
| 28 | }; |