solve problem Find And Replace Pattern

Author: P-ppc

README.md

@@ -288,6 +288,7 @@ All solutions will be accepted!
 |129|[Sum Root To Leaf Numbers](https://leetcode-cn.com/problems/sum-root-to-leaf-numbers/description/)|[java/py/js](./algorithms/SumRootToLeafNumbers)|Medium|
 |537|[Complex Number Multiplication](https://leetcode-cn.com/problems/complex-number-multiplication/description/)|[java/py/js](./algorithms/ComplexNumberMultiplication)|Medium|
 |228|[Summary Ranges](https://leetcode-cn.com/problems/summary-ranges/description/)|[java/py/js](./algorithms/SummaryRanges)|Medium|
+|890|[Find And Replace Pattern](https://leetcode-cn.com/problems/find-and-replace-pattern/description/)|[java/py/js](./algorithms/FindAndReplacePattern)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/FindAndReplacePattern/README.md

@@ -0,0 +1,2 @@
+# Find And Replace Pattern
+This problem is easy to solve by hashmap

algorithms/FindAndReplacePattern/Solution.java

@@ -0,0 +1,29 @@
+class Solution {
+    public List<String> findAndReplacePattern(String[] words, String pattern) {
+        int length = pattern.length();
+        List<String> res = new ArrayList<String>();
+        
+        for (String word : words) {
+            Map<Character, Character> charMap = new HashMap<Character, Character>(),
+                                      charReverseMap = new HashMap<Character, Character>();
+            boolean notMatch = false;
+            
+            for (int i = 0; i < length; i++) {
+                char char1 = word.charAt(i),
+                     char2 = pattern.charAt(i);
+                if (charMap.get(char1) == null && charReverseMap.get(char2) == null) {
+                    charMap.put(char1, char2);
+                    charReverseMap.put(char2, char1);
+                } else if (charMap.get(char1) == null || !charMap.get(char1).equals(char2)) {
+                    notMatch = true;
+                    break;
+                }
+            }
+            
+            if (!notMatch)
+                res.add(word);
+        }
+        
+        return res;
+    }
+}

algorithms/FindAndReplacePattern/solution.js

@@ -0,0 +1,29 @@
+/**
+ * @param {string[]} words
+ * @param {string} pattern
+ * @return {string[]}
+ */
+var findAndReplacePattern = function(words, pattern) {
+    let res = [],
+        length = pattern.length
+    
+    words.forEach(word => {
+        let charMap = {},
+            charReverseMap = {},
+            notMatch = false
+        
+        for (let i = 0; i < length; i++) {
+            if (!charMap[word[i]] && !charReverseMap[pattern[i]]) {
+                charMap[word[i]] = pattern[i]
+                charReverseMap[pattern[i]] = word[i]
+            } else if (charMap[word[i]] != pattern[i]) {
+                notMatch = true
+                break
+            }
+        }
+        if (!notMatch)
+            res.push(word)
+    })
+    
+    return res
+};

algorithms/FindAndReplacePattern/solution.py

@@ -0,0 +1,28 @@
+class Solution(object):
+    def findAndReplacePattern(self, words, pattern):
+        """
+        :type words: List[str]
+        :type pattern: str
+        :rtype: List[str]
+        """
+        res = []
+        word_length = len(pattern)
+        
+        for word in words:
+            char_map = {}
+            char_reverse_map = {}
+            not_match = False
+            
+            for i in xrange(word_length):
+                if not char_map.get(word[i]) and not char_reverse_map.get(pattern[i]):
+                    char_map[word[i]] = pattern[i]
+                    char_reverse_map[pattern[i]] = word[i]
+                elif char_map.get(word[i]) != pattern[i]:
+                    # same as char_reverse_map.get(pattern[i]) != word[i]
+                    not_match = True
+                    break
+                    
+            if not not_match:
+                res.append(word)
+        
+        return res