homework week 09

operaculus · operaculus · commit a0a62bfd5791 · 2021-01-03T23:23:58.000+08:00
diff --git a/Week_09/README.md b/Week_09/README.md
@@ -1 +1,3 @@
-学习笔记
+学习笔记
+
+字符串处理，使用Python代码更容易实现，并且不会有繁琐的索引、类型转换
diff --git a/Week_09/firstUniqChar.py b/Week_09/firstUniqChar.py
@@ -0,0 +1,15 @@
+class Solution:
+    def firstUniqChar(self, s: str) -> int:
+        counter = {}
+        if len(s) == 0:
+            return -1
+        for c in s:
+            if c in counter:
+                counter[c] += 1
+            else:
+                counter[c] = 1
+
+        for k, v in counter.items():
+            if v == 1:
+                return s.index(k)
+        return -1
diff --git a/Week_09/panlindrome.py b/Week_09/panlindrome.py
@@ -0,0 +1,20 @@
+class Solution:
+    maxLen =0
+    lowIdx = 0
+    def extendPalindrome(self, s, j, k):
+        while j >=0 and k < len(s) and s[j] == s[k] :
+            j -= 1
+            k += 1
+        if k - j -1 > self.maxLen:
+            self.lowIdx = j+1
+            self.maxLen = k - j -1
+
+    def longestPalindrome(self, s: str) -> str:
+        if len(s) < 2:
+            return s
+
+        size = len(s)
+        for i in range(0, size-1):
+            self.extendPalindrome(s, i, i)
+            self.extendPalindrome(s, i, i+1)
+        return s[self.lowIdx:self.lowIdx + self.maxLen]
