feat: add 290

shiyutim · shiyutim · commit ea57cdf20d93 · 2023-04-02T18:22:09.000+08:00
diff --git a/docs/1-100/290.md b/docs/1-100/290.md
@@ -0,0 +1,76 @@
+# 290 单词规律
+
+## 题目
+
+给定一种规律 pattern  和一个字符串  s ，判断 s  是否遵循相同的规律。
+
+这里的   遵循   指完全匹配，例如， pattern  里的每个字母和字符串  s  中的每个非空单词之间存在着双向连接的对应规律。
+
+示例 1:
+
+```js
+输入: (pattern = "abba"), (s = "dog cat cat dog");
+输出: true;
+```
+
+示例 2:
+
+```js
+输入: (pattern = "abba"), (s = "dog cat cat fish");
+输出: false;
+```
+
+示例 3:
+
+```js
+输入: (pattern = "aaaa"), (s = "dog cat cat dog");
+输出: false;
+```
+
+提示:
+
+1 <= pattern.length <= 300
+pattern  只包含小写英文字母
+1 <= s.length <= 3000
+s  只包含小写英文字母和  ' '
+s  不包含 任何前导或尾随对空格
+s  中每个单词都被 单个空格 分隔
+
+## 题解
+
+1.
+
+:::tip
+<runtime :list="[60, 68.48, 40.9, 63.31]" />
+:::
+
+```js
+/**
+ * @param {string} pattern
+ * @param {string} s
+ * @return {boolean}
+ */
+var wordPattern = function (pattern, s) {
+    let map = {};
+    let list = [];
+    const wordList = s.split(" ");
+    const patternLen = pattern.length;
+
+    if (patternLen !== wordList.length) return false;
+
+    for (let i = 0; i < patternLen; i++) {
+        const currentStr = pattern[i];
+        const currentWord = wordList[i];
+
+        if (map[currentStr]) {
+            if (map[currentStr] !== currentWord) return false;
+        } else {
+            if (list.includes(currentWord)) return false;
+            map[currentStr] = currentWord;
+            list.push(currentWord);
+        }
+    }
+
+    return true;
+};
+```
