qq_37663658的博客

class Solution: def threeSumClosest(self, nums: List[int], target: int) -> int: #-1 2 1 -4 #i l r #-4 -1 1 2 min_=10000 res=0 for i in range(len(nums)): l=i+1 r=len(nums)-1

本人想法， 当然是暴力啦，超时警告：class Solution: def maxArea(self, height: List[int]) -> int: max=0 for i in range(len(height)): for j in range(len(height)): t=min(height[j],height[i])*abs(i-j) if

首先暴力解法不用说了，看了评论的双指针提示，尝试写了如下代码：class Solution: def threeSum(self, nums: List[int]) -> List[List[int]]: nums.sort() result=[] for i in range(len(nums)): l=i+1 r=len(nums)-1 while(l<r):

这个题很早以前做过了，思路有的但是python的字典的一些操作记得不清：class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: dict1={} list1=[] for j in range(0,len(nums)): if target-nums[j] in dict1: list1=[d

刷题开始了