feat: add python and java solutions to leetcode problem: No.0290

Author: yanglbme

solution/0200-0299/0290.Word Pattern/README.md

@@ -43,15 +43,51 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def wordPattern(self, pattern: str, s: str) -> bool:
+        ch2str, str2ch = {}, {}
+        ss = s.split(' ')
+        n = len(pattern)
+        if n != len(ss):
+            return False
+        for i in range(n):
+            if ch2str.get(pattern[i]) is not None and ch2str.get(pattern[i]) != ss[i]:
+                return False
+            if str2ch.get(ss[i]) is not None and str2ch.get(ss[i]) != pattern[i]:
+                return False
+            ch2str[pattern[i]] = ss[i]
+            str2ch[ss[i]] = pattern[i]
+        return True
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public boolean wordPattern(String pattern, String s) {
+        Map<Character, String> ch2str = new HashMap<>();
+        Map<String, Character> str2ch = new HashMap<>();
+        String[] ss = s.split(" ");
+        int n = pattern.length();
+        if (n != ss.length) {
+            return false;
+        }
+        for (int i = 0; i < n; ++i) {
+            char ch = pattern.charAt(i);
+            if (ch2str.containsKey(ch) && !ch2str.get(ch).equals(ss[i])) {
+                return false;
+            }
+            if (str2ch.containsKey(ss[i]) && !str2ch.get(ss[i]).equals(ch)) {
+                return false;
+            }
+            ch2str.put(ch, ss[i]);
+            str2ch.put(ss[i], ch);
+        }
+        return true;
+    }
+}
 ```
 
 ### **...**

solution/0200-0299/0290.Word Pattern/README_EN.md

@@ -51,13 +51,49 @@ You may assume <code>pattern</code> contains only lowercase letters, and <code>s
 ### **Python3**
 
 ```python
-
+class Solution:
+    def wordPattern(self, pattern: str, s: str) -> bool:
+        ch2str, str2ch = {}, {}
+        ss = s.split(' ')
+        n = len(pattern)
+        if n != len(ss):
+            return False
+        for i in range(n):
+            if ch2str.get(pattern[i]) is not None and ch2str.get(pattern[i]) != ss[i]:
+                return False
+            if str2ch.get(ss[i]) is not None and str2ch.get(ss[i]) != pattern[i]:
+                return False
+            ch2str[pattern[i]] = ss[i]
+            str2ch[ss[i]] = pattern[i]
+        return True
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public boolean wordPattern(String pattern, String s) {
+        Map<Character, String> ch2str = new HashMap<>();
+        Map<String, Character> str2ch = new HashMap<>();
+        String[] ss = s.split(" ");
+        int n = pattern.length();
+        if (n != ss.length) {
+            return false;
+        }
+        for (int i = 0; i < n; ++i) {
+            char ch = pattern.charAt(i);
+            if (ch2str.containsKey(ch) && !ch2str.get(ch).equals(ss[i])) {
+                return false;
+            }
+            if (str2ch.containsKey(ss[i]) && !str2ch.get(ss[i]).equals(ch)) {
+                return false;
+            }
+            ch2str.put(ch, ss[i]);
+            str2ch.put(ss[i], ch);
+        }
+        return true;
+    }
+}
 ```
 
 ### **...**

solution/0200-0299/0290.Word Pattern/Solution.java

@@ -1,19 +1,23 @@
 class Solution {
-    public boolean wordPattern(String pattern, String str) {
-        String[] split = str.split(" ");
-        if (pattern.length() != split.length) {
+    public boolean wordPattern(String pattern, String s) {
+        Map<Character, String> ch2str = new HashMap<>();
+        Map<String, Character> str2ch = new HashMap<>();
+        String[] ss = s.split(" ");
+        int n = pattern.length();
+        if (n != ss.length) {
             return false;
         }
-        Map<Character, Integer> map1 = new HashMap<>();
-        Map<String, Integer> map2 = new HashMap<>();
-        for (int i = 0; i < pattern.length(); ++i) {
-            char c = pattern.charAt(i);
-            if (!map1.getOrDefault(c, -1).equals(map2.getOrDefault(split[i], -1))) {
+        for (int i = 0; i < n; ++i) {
+            char ch = pattern.charAt(i);
+            if (ch2str.containsKey(ch) && !ch2str.get(ch).equals(ss[i])) {
                 return false;
             }
-            map1.put(c, i);
-            map2.put(split[i], i);
+            if (str2ch.containsKey(ss[i]) && !str2ch.get(ss[i]).equals(ch)) {
+                return false;
+            }
+            ch2str.put(ch, ss[i]);
+            str2ch.put(ss[i], ch);
         }
         return true;
     }
-}
+}

solution/0200-0299/0290.Word Pattern/Solution.py

@@ -0,0 +1,15 @@
+class Solution:
+    def wordPattern(self, pattern: str, s: str) -> bool:
+        ch2str, str2ch = {}, {}
+        ss = s.split(' ')
+        n = len(pattern)
+        if n != len(ss):
+            return False
+        for i in range(n):
+            if ch2str.get(pattern[i]) is not None and ch2str.get(pattern[i]) != ss[i]:
+                return False
+            if str2ch.get(ss[i]) is not None and str2ch.get(ss[i]) != pattern[i]:
+                return False
+            ch2str[pattern[i]] = ss[i]
+            str2ch[ss[i]] = pattern[i]
+        return True