2020-10-03

JiayangWu · JiayangWu · commit fd6f8321035b · 2020-10-03T23:52:48.000-04:00
diff --git a/0001.两数之和/0001-两数之和.py b/0001.两数之和/0001-两数之和.py
@@ -9,4 +9,4 @@ def twoSum(self, nums, target):
         for i, num in enumerate(nums):
             if target - num in dic:
                 return [dic[target - num], i]
-            dic[num] = i
+            dic[num] = i 
diff --git a/0003.无重复字符的最长子串/0003-无重复字符的最长子串.py b/0003.无重复字符的最长子串/0003-无重复字符的最长子串.py
@@ -4,13 +4,13 @@ def lengthOfLongestSubstring(self, s):
         :type s: str
         :rtype: int
         """
-        record = {}
-        start, res = 0, 0
-        for end in range(len(s)):
-            if s[end] in record:
-                start = max(start, record[s[end]] + 1)
-                
-            record[s[end]] = end
-            res = max(res, end - start + 1)
-            
+        left, right = 0, 0
+        dic = dict()
+        res = 0
+        while right < len(s):
+            if s[right] in dic:
+                left = max(left, dic[s[right]] + 1)
+            dic[s[right]] = right
+            res = max(res, right - left + 1)
+            right += 1
         return res
diff --git a/0004.寻找两个正序数组的中位数/0004-寻找两个正序数组的中位数.py b/0004.寻找两个正序数组的中位数/0004-寻找两个正序数组的中位数.py
@@ -0,0 +1,24 @@
+class Solution(object):
+    def findMedianSortedArrays(self, nums1, nums2):
+        """
+        :type nums1: List[int]
+        :type nums2: List[int]
+        :rtype: float
+        """
+        res = []
+        p1, p2 = 0, 0
+        while p1 < len(nums1) and p2 < len(nums2):
+            if nums1[p1] <= nums2[p2]:
+                res.append(nums1[p1])
+                p1 += 1
+            else:
+                res.append(nums2[p2])
+                p2 += 1
+        while p1 < len(nums1):
+            res.append(nums1[p1])
+            p1 += 1
+        while p2 < len(nums2):
+            res.append(nums2[p2])
+            p2 += 1
+        print res
+        return res[len(res) // 2] if len(res) % 2 == 1 else (res[len(res) // 2 - 1] + res[len(res) // 2]) * 1.0 / 2
diff --git a/0005.最长回文子串/0005-最长回文子串.py b/0005.最长回文子串/0005-最长回文子串.py
@@ -4,30 +4,21 @@ def longestPalindrome(self, s):
         :type s: str
         :rtype: str
         """
-        left, right = 0, 0
-        res, string = 0, ""
+        res = ""
         for i in range(len(s)):
-            left, right = i, i
-            while(left >= 0 and right < len(s) and s[left] == s[right]):
-                left -= 1
-                right += 1
-            left += 1
-            right -= 1
-            
-            if right - left + 1 > res:
-                res = right - left + 1
-                string = s[left:right + 1]
-                
-        for i in range(1, len(s)):
-            left, right = i - 1, i
-            while(left >= 0 and right < len(s) and s[left] == s[right]):
-                left -= 1
-                right += 1
-            left += 1
-            right -= 1
-            
-            if right - left + 1 > res:
-                res = right - left + 1
-                string = s[left:right + 1]      
-        return string
-        
+            tmp = self.centralSpread(i, i, s)
+            if len(tmp) > len(res):
+                res = tmp
+            tmp = self.centralSpread(i, i + 1, s)
+            if len(tmp) > len(res):
+                res = tmp
+        return res
+
+    def centralSpread(self, left, right, s):
+        res = ""
+        while left >= 0 and right < len(s) and s[left] == s[right]:
+            res = s[left: right + 1]
+            left -= 1
+            right += 1
+        # print res, left, right
+        return res
