class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
res=[]
if(not nums or len(nums)<3):
return []
nums.sort()
res=[]
for i in range(len(nums)):
if(nums[i]>0):
return res
if(i>0 and nums[i]==nums[i-1]):
continue
L=i+1
R=len(nums)-1
while(L<R):
if(nums[i]+nums[L]+nums[R]==0):
res.append([nums[i],nums[L],nums[R]])
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
elif(nums[i]+nums[L]+nums[R]>0):
R=R-1
else:
L=L+1
return res
第四次打卡
最新推荐文章于 2023-09-14 19:51:58 发布