作业提交

zhoujizhou · zhoujizhou · commit 3900c3cbc4a5 · 2020-08-09T22:50:49.000+08:00
diff --git a/Week09/NOTE.md b/Week09/NOTE.md
@@ -1 +1,14 @@
-学习笔记
+Atoi代码演示模板
+
+class Solution(object):
+    def myAtoi(self, s):
+        if len(s) == 0 : return 0
+        ls = list(s.strip())
+        
+        sign = -1 if ls[0] == '-' else 1
+        if ls[0] in ['-','+'] : del ls[0]
+        ret, i = 0, 0
+        while i < len(ls) and ls[i].isdigit() :
+            ret = ret*10 + ord(ls[i]) - ord('0')
+            i += 1
+        return max(-2**31, min(sign * ret,2**31-1))
diff --git a/Week09/anagrams.py b/Week09/anagrams.py
@@ -0,0 +1,35 @@
+class Solution:
+    def findAnagrams(self, s: str, p: str) -> List[int]:
+        len_s = len(s)
+        len_p = len(p)
+        if len_s < len_p:
+            return []
+        char_dict = {}
+        win_dict = {}
+        diff = len_p
+        for ch in p:
+            char_dict[ch] = char_dict.get(ch, 0) + 1
+            win_dict[ch] = 0
+        for i in range(len_p):
+            if s[i] in win_dict:
+                if win_dict[s[i]] < char_dict[s[i]]:
+                    diff -= 1
+                win_dict[s[i]] += 1
+        p, q = 0, len_p - 1
+        res = []
+        if diff == 0:
+            res.append(0)
+        while q + 1 < len_s:
+            q += 1
+            if s[q] in win_dict:
+                if win_dict[s[q]] < char_dict[s[q]]:
+                    diff -= 1
+                win_dict[s[q]] += 1
+            if s[p] in win_dict:
+                if win_dict[s[p]] <= char_dict[s[p]]:
+                    diff += 1
+                win_dict[s[p]] -= 1
+            p += 1
+            if diff == 0:
+                res.append(p)
+        return res
diff --git a/Week09/firstUnChar.py b/Week09/firstUnChar.py
@@ -0,0 +1,7 @@
+class Solution:
+    def firstUniqChar(self, s: str) -> int:
+        count = collections.Counter(s)
+        for idx, ch in enumerate(s):
+            if count[ch] == 1:
+                return idx
+        return -1
diff --git a/Week09/palindromic.py b/Week09/palindromic.py
@@ -0,0 +1,12 @@
+class Solution:
+    def longestPalindrome(self, s: str) -> str:
+        if s==s[::-1]:
+            return s
+        max_len = 1
+        res = s[0]
+        for i in range(len(s) - 1):
+            for j in range(i + 1, len(s)):
+                if j - i + 1 > max_len and s[i:j+1] == s[i:j+1][::-1]:
+                    max_len = j - i + 1
+                    res = s[i:j + 1]
+        return res
