Merge pull request #1260 from cotijoy/master

melody-li · web-flow · commit 48afed51c8a2 · 2019-12-12T18:48:08.000+08:00
366-Week 08
diff --git a/Week 08/id_366/Leetcode_115_366.java b/Week 08/id_366/Leetcode_115_366.java
@@ -0,0 +1,22 @@
+/*
+ * @lc app=leetcode.cn id=115 lang=java
+ *
+ * [115] 不同的子序列
+ */
+
+// @lc code=start
+class Solution {
+    public int numDistinct(String s, String t) {
+        int[][] dp = new int[t.length() + 1][s.length() + 1];
+        for (int j = 0; j < s.length() + 1; j++) dp[0][j] = 1;
+        for (int i = 1; i < t.length() + 1; i++) {
+            for (int j = 1; j < s.length() + 1; j++) {
+                if (t.charAt(i - 1) == s.charAt(j - 1)) dp[i][j] = dp[i - 1][j - 1] + dp[i][j - 1];
+                else dp[i][j] = dp[i][j - 1];
+            }
+        }
+        return dp[t.length()][s.length()];
+    }
+}
+// @lc code=end
+
diff --git a/Week 08/id_366/Leetcode_387_366.java b/Week 08/id_366/Leetcode_387_366.java
@@ -0,0 +1,23 @@
+/*
+ * @lc app=leetcode.cn id=387 lang=java
+ *
+ * [387] 字符串中的第一个唯一字符
+ */
+
+// @lc code=start
+class Solution {
+    public int firstUniqChar(String s) {
+        Map<Character, Integer> map = new HashMap<>();
+        for (int i = 0; i < s.length(); i++) {
+            map.put(s.charAt(i), map.getOrDefault(s.charAt(i), 0) + 1);
+        }
+        for (int i = 0; i < s.length(); i++) {
+            if (map.get(s.charAt(i)) == 1) {
+                return i;
+            }
+        }
+        return -1;
+    }
+}
+// @lc code=end
+
