国庆打卡

Author: StrayCamel247

questions/15.三数之和.py

@@ -30,12 +30,6 @@ def threeSum(self, nums: List[int]) -> List[List[int]]:
                     L = bisect.bisect_right(nums,nums[L], L, R)
                     R = bisect.bisect_left(nums,nums[R], L, R)-1
 
-                    # while L < R and nums[L] == nums[L+1] :
-                    #     L = L+1
-                    # while L < R and nums[R] == nums[R-1] :
-                    #     R = R-1
-                    # L = L+1
-                    # R = R-1
                 else:
                     L,R = L+(_sum < 0),R-(_sum > 0)
         return self.res

questions/18.四数之和.py

@@ -22,17 +22,16 @@ def classic_double_index(self, nums: List[int], target: int) -> List[List[int]]:
             if v*4 > target:
                 break
             # 当数组最大值和都小于target或者已经遍历过，遍历下一个
-            if v + 3*nums[-1] < target or (v == nums[k-1] and k>0):
+            if v + 3*nums[-1] < target or (v == nums[k-1] and k > 0):
                 continue
             for _k, _v in enumerate(nums[k+1:-2], k+1):
                 # 同理
                 if v + _v*3 > target:
                     break
-                if v + _v + nums[-1]*2 < target or (_v == nums[_k-1] and _k>k+1):
+                if v + _v + nums[-1]*2 < target or (_v == nums[_k-1] and _k > k+1):
                     continue
                 R = len(nums)-1
-                L = max(_k + 1, bisect.bisect_left(nums,
-                                                   target-nums[R] - _v - v, _k + 1, R) - 1)
+                L = max(_k + 1, bisect.bisect_left(nums,  target-nums[R] - _v - v, _k + 1, R) - 1)
                 while L < R:
                     _sum = v+_v+nums[L]+nums[R]
                     if _sum == target:
@@ -43,39 +42,39 @@ def classic_double_index(self, nums: List[int], target: int) -> List[List[int]]:
                     else:
                         L, R = L+(_sum < target), R-(_sum > target)
         return [list(_) for _ in set(self.result)]
-    
+
     def brute_for(self, nums: List[int], target: int) -> List[List[int]]:
         nums.sort()
         if len(nums) < 4:
             return []
-        counter={}
+        counter = {}
         for n in nums:
-            counter[n]=counter.get(n,0)+1
+            counter[n] = counter.get(n, 0)+1
         """双指针"""
         for k, v in enumerate(nums[:-3]):
             # 当数组最小值和都大于target 跳出
             if v*4 > target:
                 break
             # 当数组最大值和都小于target或者已经遍历过，遍历下一个
-            if v + 3*nums[-1] < target or (v == nums[k-1] and k>0):
+            if v + 3*nums[-1] < target or (v == nums[k-1] and k > 0):
                 continue
-            counter[v]-=1
+            counter[v] -= 1
             for _k, _v in enumerate(nums[k+1:-2], k+1):
                 # 同理
                 if v + _v*3 > target:
                     break
-                if v + _v + nums[-1]*2 < target or (_v == nums[_k-1] and _k>k+1):
+                if v + _v + nums[-1]*2 < target or (_v == nums[_k-1] and _k > k+1):
                     continue
-                counter[_v]-=1
-                for __k in range(_k if counter[_v]>0 else _k+1,len(nums)):
-                    c=nums[__k]
-                    d=target-v-_v-c
-                    if c>d:
+                counter[_v] -= 1
+                for __k in range(_k if counter[_v] > 0 else _k+1, len(nums)):
+                    c = nums[__k]
+                    d = target-v-_v-c
+                    if c > d:
                         break
-                    if d not in counter or c==d and counter[c]<2:
+                    if d not in counter or c == d and counter[c] < 2:
                         continue
-                    self.result.append((v,_v,c,d))
-                counter[_v]+=1
+                    self.result.append((v, _v, c, d))
+                counter[_v] += 1
         return [list(_) for _ in set(self.result)]
 
     def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
@@ -88,4 +87,4 @@ def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
 # @lc code=end
 if __name__ == "__main__":
     test = Solution()
-    print(test.fourSum([0,0,0,0], 0))
+    print(test.fourSum([0, 0, 0, 0], 0))

questions/2.两数相加.py

@@ -41,7 +41,7 @@
 
 class Solution:
     def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
-        re = ListNode(0)
+        re = ListNode('head')
         r=re
         carry=0
         while(l1 or l2):
@@ -59,4 +59,6 @@ def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
 # @lc code=end
 if __name__ == "__main__":
     test = Solution()
-    print(test.addTwoNumbers(ListNode([2,4,3]),ListNode([5,6,4])))
+    print(test.addTwoNumbers(ListNode([2,4,3]),ListNode([5,6,4])))
+    test= []
+    test.insert