Merge pull request gzc426#175 from 751933593/master

gzc426 · web-flow · commit ab6cc45cab44 · 2018-12-01T10:31:29.000+08:00
1
diff --git a/2018.11.30-leetcode890/刘润泽.md b/2018.11.30-leetcode890/刘润泽.md
@@ -0,0 +1,84 @@
+## LeetCode890
+> language：Java
+
+> version：jdk1.7
+
+```java
+/**
+     * 思路一：把pattern弄成一个记忆，然后依次比较
+     * 思路二：把pattern的某个特点记录下来，依次比较，然后再把下一个特点记录下来，依次比较...
+     *  下面代码是思路一的实现
+     */
+    public static List<String> findAndReplacePattern(String[] words, String pattern) {
+
+        List<String> resultList = new ArrayList<>();
+        List<List<Integer>> patternRule = getRule(pattern);
+
+        for (int i=0;i<words.length;i++){
+            boolean tempStatus = true;
+            //长度不一致，直接下一个
+            if (words[i].length()!=pattern.length()) continue;
+
+            List<List<Integer>> wordRule = getRule(words[i]);
+            if (patternRule.size()!=wordRule.size()) continue;
+            for (int j=0;j<patternRule.size()&&tempStatus;j++){
+                List<Integer> patternRuleIntegers = patternRule.get(j);
+                List<Integer> wordRuleIntegers = wordRule.get(j);
+                for (int m=0;m<patternRuleIntegers.size();m++){
+                    if (patternRuleIntegers.size()!=wordRuleIntegers.size()){
+                        tempStatus =false;
+                        break;
+                    }
+                    if (patternRuleIntegers.get(m)!=wordRuleIntegers.get(m)){
+                        tempStatus =false;
+                        break;
+                    }
+                }
+
+            }
+            if (tempStatus) resultList.add(words[i]);
+
+        }
+        return resultList;
+    }
+
+    /**
+     * 传入字符串可以获得其规则（aabacc的规则为{{0,1,3},{2},{4,5}}）
+     * @param pattern
+     * @return
+     */
+    public static List<List<Integer>> getRule(String pattern){
+        //记录pattern的所有特点
+        List<List<Integer>> characterList = new ArrayList<>();
+        String currentCharacter = "";
+        List<Integer> recordList = new ArrayList<>();
+
+        for (int i=0;i<pattern.length();i++){
+            if (recordList.contains(i)){
+                continue;
+            }
+            int tempIndex;
+            currentCharacter = pattern.substring(i,i+1);
+            List<Integer> tempList=new ArrayList<>();
+            for (int j=i-1;;) {
+                tempIndex = pattern.indexOf(currentCharacter, j);
+                if (tempIndex==-1) break;
+
+                recordList.add(tempIndex);
+                tempList.add(tempIndex);
+                if (tempIndex==pattern.length()-1) break;
+                j=tempIndex+1;
+            }
+            characterList.add(tempList);
+        }
+        return characterList;
+    }
+
+    public static void main(String[] args) {
+        String[] words = new String[]{"abc","deq","meemccccm","aqqa","dkd","ccc"};
+        List<String> list = findAndReplacePattern(words, "abbacccca");
+        for (String s : list){
+            System.out.println(s);
+        }
+    }
+```
