给定一个包含 n 个整数的数组 nums
,判断 nums
中是否存在三个元素 a,b,c ,使得 a + b + c = 0 ?找出所有满足条件且不重复的三元组。
方案一:
class Solution(object):
def threeSum(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
nums.sort()#排序
res =[]
i = 0
for i in range(len(nums)):
if i == 0 or nums[i] > nums[i-1]:
l = i + 1
r = len(nums)-1
while l < r:
s = nums[i] + nums[l] + nums[r]
if s == 0:
res.append([nums[i], nums[l], nums[r]])
l += 1
r -= 1
while l < r and nums[l] == nums[l-1]:#避免相同值
l += 1
while r > l and nums[r] == nums[r+1]:
r -= 1
elif s > 0:
r -= 1
else :
l += 1
return res