Merge pull request gzc426#232 from qiuguomeng/master

gzc426 · web-flow · commit ec54c32ee3b4 · 2018-12-02T17:04:32.000+08:00
1
diff --git a/2018.11.30-leetcode890/。。。.md b/2018.11.30-leetcode890/。。。.md
@@ -0,0 +1,29 @@
+    /*
+    * words中的单词与pattern逐个字母对比，如果map中value为-1则保存映射关系，
+    * 否则进行比较是否为同一映射关系，相同则继续比较，否则表明该字符不符合
+    * */
+    public List<String> findAndReplacePattern(String[] words, String pattern) {
+        List<String> results = new ArrayList<>();
+        Set characters = new HashSet<Character>();
+        Map<Character,Integer> map = new HashMap<>();//map保存字符映射关系
+        out:
+        for (int i = 0; i < words.length; i++) {//遍历words
+            for (int j = 0; j < pattern.length(); j++) {//初始化map
+                map.put(pattern.charAt(j), -288);
+            }
+            for (int k = 0; k < words[i].length(); k++) {
+                if (map.get(pattern.charAt(k)) == -288 && !characters.contains(words[i].charAt(k))) {
+                    map.put(pattern.charAt(k), pattern.charAt(k) - words[i].charAt(k));
+                    characters.add(words[i].charAt(k));
+                } else {
+                    if (words[i].charAt(k) != -map.get(pattern.charAt(k)) + pattern.charAt(k)) {
+                        characters.clear();
+                        continue out;
+                    }
+                }
+            }
+            results.add(words[i]);
+            characters.clear();
+        }
+        return results;
+    }
diff --git a/2018.12.1-leetcode387/。。。.md b/2018.12.1-leetcode387/。。。.md
@@ -0,0 +1,19 @@
+class Solution {
+    public int firstUniqChar(String s) {
+        if (s.trim().length() == 0)return -1;
+        int result = Integer.MAX_VALUE;
+        Map<Character,Integer> map = new HashMap<>();
+        for (int i = 0; i < s.length(); i++){
+            if (map.containsKey(s.charAt(i))){
+                map.put(s.charAt(i),Integer.MAX_VALUE);
+            }else {
+                map.put(s.charAt(i),i);
+            }
+        }
+        for (int i : map.values()){
+            result = Math.min(i,result);
+        }
+        if (result == Integer.MAX_VALUE)result=-1;
+        return result;
+    }
+}
