Merge pull request gzc426#184 from beddingearly/master

gzc426 · web-flow · commit 9e1ceb222d33 · 2018-12-01T10:29:32.000+08:00
4
diff --git a/2018.11.29-leetcode443/Tony the Cyclist.md b/2018.11.29-leetcode443/Tony the Cyclist.md
@@ -0,0 +1,43 @@
+```
+class Solution {
+    public int compress(char[] chars) {
+        char base = chars[0];
+        int count = 1;
+        int pos = 0;
+        for (int i = 1; i < chars.length; i++){
+            if (base != chars[i]){
+                base = chars[i];
+                if (count == 1){
+                    chars[++pos] = base;
+                    continue;
+                }
+                // 先计数再写入下一个值
+                for (int j = 0; j < String.valueOf(count).length(); j++){
+                    chars[++pos] = String.valueOf(count).charAt(j);
+                }
+                count = 1;
+                chars[++pos] = base;
+            }
+            else {// base == chars[i]
+                count ++;
+                if (i == chars.length-1){
+                    if (count == 1){
+                        continue;
+                    }
+                    for (int j = 0; j < String.valueOf(count).length(); j++){
+                        chars[++pos] = String.valueOf(count).charAt(j);
+                    }
+
+                }
+
+            }
+
+        }
+        pos++;
+        //splitArray(chars, pos);
+        if (pos == 0)
+            return 1;
+        return pos;
+}
+}
+```
diff --git a/2018.11.30-leetcode890/Tony the Cyclist.md b/2018.11.30-leetcode890/Tony the Cyclist.md
@@ -0,0 +1,40 @@
+```
+import java.util.*;
+class Solution {
+    public List<String> findAndReplacePattern(String[] words, String pattern) {
+        List<String> result = new ArrayList();
+        String p = transfor(pattern);
+        String w;
+        String ww;
+        for (int i = 0; i < words.length; i++){
+            w = words[i];
+            ww = transfor(w);
+            if (ww.equals(p)){
+                result.add(w);
+            }
+
+        }
+        return result;
+    }
+
+    private String transfor(String s){
+        Map<Character, Character> m = new HashMap<>();
+        char j = 0;
+        String ss = "";
+        m.put(s.charAt(0), (char)(j + '0'));
+        for(int i = 1; i < s.length(); i++){
+            if (s.charAt(i-1) != s.charAt(i)){
+                if (m.containsKey(s.charAt(i))){
+                    ss += m.get(s.charAt(i));
+                }
+                else {
+                    ++j;
+                    ss += (char)(j+'0');
+                    m.put(s.charAt(i), (char)(j + '0'));
+                }
+            }
+        }
+        return ss;
+    }
+}
+```
diff --git a/2018.12.1-leetcode387/Tony the Cyclist.md b/2018.12.1-leetcode387/Tony the Cyclist.md
@@ -0,0 +1,22 @@
+```
+class Solution {
+    public int firstUniqChar(String s) {
+        //char[] c = s.toCharArray();
+        Map<Character, Integer> m = new HashMap<>();
+        for (int i = 0; i < s.length(); i++){
+            if (m.containsKey(s.charAt(i))){
+                m.put(s.charAt(i), m.get(s.charAt(i))+1);
+            }
+            else {
+                m.put(s.charAt(i), 1);
+            }
+        }
+        for (int i = 0; i < s.length(); i++){
+            if (m.get(s.charAt(i)) == 1){
+                return i;
+            }
+        }
+        return -1;
+    }
+}
+```
