algorithm004-01 · KarsonWu · Dec 8, 2019 · Dec 9, 2019
diff --git a/Week 08/id_001/NOTE.md b/Week 08/id_001/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_006/NOTE.md b/Week 08/id_006/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_011/NOTE.md b/Week 08/id_011/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_016/NOTE.md b/Week 08/id_016/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_021/NOTE.md b/Week 08/id_021/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_026/NOTE.md b/Week 08/id_026/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_031/NOTE.md b/Week 08/id_031/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_036/NOTE.md b/Week 08/id_036/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_041/NOTE.md b/Week 08/id_041/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_046/NOTE.md b/Week 08/id_046/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_051/NOTE.md b/Week 08/id_051/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_056/NOTE.md b/Week 08/id_056/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_061/NOTE.md b/Week 08/id_061/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_066/NOTE.md b/Week 08/id_066/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_071/NOTE.md b/Week 08/id_071/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_076/NOTE.md b/Week 08/id_076/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_081/NOTE.md b/Week 08/id_081/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_086/NOTE.md b/Week 08/id_086/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_091/NOTE.md b/Week 08/id_091/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_096/NOTE.md b/Week 08/id_096/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_101/NOTE.md b/Week 08/id_101/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_106/NOTE.md b/Week 08/id_106/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_111/NOTE.md b/Week 08/id_111/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_116/NOTE.md b/Week 08/id_116/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_121/NOTE.md b/Week 08/id_121/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_126/NOTE.md b/Week 08/id_126/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_131/NOTE.md b/Week 08/id_131/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_136/NOTE.md b/Week 08/id_136/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_141/NOTE.md b/Week 08/id_141/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_146/NOTE.md b/Week 08/id_146/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_151/NOTE.md b/Week 08/id_151/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_156/NOTE.md b/Week 08/id_156/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_161/NOTE.md b/Week 08/id_161/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_166/NOTE.md b/Week 08/id_166/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_171/NOTE.md b/Week 08/id_171/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_176/NOTE.md b/Week 08/id_176/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_181/NOTE.md b/Week 08/id_181/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_186/NOTE.md b/Week 08/id_186/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_191/NOTE.md b/Week 08/id_191/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_196/LeetCode_300_196.py b/Week 08/id_196/LeetCode_300_196.py
@@ -0,0 +1,37 @@
+#给定一个无序的整数数组，找到其中最长上升子序列的长度。 
+#
+# 示例: 
+#
+# 输入: [10,9,2,5,3,7,101,18]
+#输出: 4 
+#解释: 最长的上升子序列是 [2,3,7,101]，它的长度是 4。 
+#
+# 说明: 
+#
+# 
+# 可能会有多种最长上升子序列的组合，你只需要输出对应的长度即可。 
+# 你算法的时间复杂度应该为 O(n2) 。 
+# 
+#
+# 进阶: 你能将算法的时间复杂度降低到 O(n log n) 吗? 
+# Related Topics 二分查找 动态规划
+
+
+
+#leetcode submit region begin(Prohibit modification and deletion)
+class Solution(object):
+    def lengthOfLIS(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: int
+        """
+        if not nums: return 0
+        dp = [1] * len(nums)
+        for i in range(len(nums)):
+            for j in range(i):
+                if nums[j] < nums[i]:  # 如果要求非严格递增，将此行 '<' 改为 '<=' 即可。
+                    dp[i] = max(dp[i], dp[j] + 1)
+        return max(dp)
+
+
+#leetcode submit region end(Prohibit modification and deletion)
diff --git a/Week 08/id_196/LeetCode_387_196.py b/Week 08/id_196/LeetCode_387_196.py
@@ -0,0 +1,40 @@
+#给定一个字符串，找到它的第一个不重复的字符，并返回它的索引。如果不存在，则返回 -1。 
+#
+# 案例: 
+#
+# 
+#s = "leetcode"
+#返回 0.
+#
+#s = "loveleetcode",
+#返回 2.
+# 
+#
+# 
+#
+# 注意事项：您可以假定该字符串只包含小写字母。 
+# Related Topics 哈希表 字符串
+
+
+
+#leetcode submit region begin(Prohibit modification and deletion)
+class Solution(object):
+    def firstUniqChar(self, s):
+        """
+        :type s: str
+        :rtype: int
+        """
+        count = collections.Counter(s)
+
+
+        index = 0
+        for ch in s:
+            if count[ch] == 1:
+                return index
+            else:
+                index += 1
+        return -1
+
+
+
+#leetcode submit region end(Prohibit modification and deletion)
diff --git a/Week 08/id_196/NOTE.md b/Week 08/id_196/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_201/NOTE.md b/Week 08/id_201/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_206/NOTE.md b/Week 08/id_206/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_211/NOTE.md b/Week 08/id_211/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_216/NOTE.md b/Week 08/id_216/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_221/NOTE.md b/Week 08/id_221/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_226/NOTE.md b/Week 08/id_226/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_231/NOTE.md b/Week 08/id_231/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_236/NOTE.md b/Week 08/id_236/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_241/NOTE.md b/Week 08/id_241/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_246/NOTE.md b/Week 08/id_246/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_251/NOTE.md b/Week 08/id_251/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_256/NOTE.md b/Week 08/id_256/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_261/NOTE.md b/Week 08/id_261/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_266/NOTE.md b/Week 08/id_266/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_271/NOTE.md b/Week 08/id_271/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_276/NOTE.md b/Week 08/id_276/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_281/NOTE.md b/Week 08/id_281/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_286/NOTE.md b/Week 08/id_286/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_291/NOTE.md b/Week 08/id_291/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_296/NOTE.md b/Week 08/id_296/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_301/NOTE.md b/Week 08/id_301/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_306/NOTE.md b/Week 08/id_306/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_311/NOTE.md b/Week 08/id_311/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+
diff --git a/Week 08/id_316/NOTE.md b/Week 08/id_316/NOTE.md
@@ -0,0 +1,4 @@
+# NOTE
+
+
+