力扣的三数之和解法(Python3)
题目描述:
定一个包含 n 个整数的数组 nums,判断 nums 中是否存在三个元素 a,b,c ,使得 a + b + c = 0 ?找出所有满足条件且不重复的三元组。
注意:答案中不可以包含重复的三元组。
示例:
给定数组 nums = [-1, 0, 1, 2, -1, -4],
满足要求的三元组集合为:
[
[-1, 0, 1],
[-1, -1, 2]
]
参考程序1:
class Solution(object):
def threeSum(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
list = []
nums.sort()
for i in range(len(nums)):
if nums[i] > 0:
break
if i > 0 and nums[i] == nums[i-1]:
continue
j = i + 1
k = len(nums) - 1
while j < k:
if nums[j] + nums[k] == -nums[i]:
list.append([nums[i], nums[j], nums[k]])
while j < k and nums[j] == nums[j+1]: j += 1
while j < k and nums[k] == nums[k-1]: k -= 1
j += 1
k -= 1
elif nums[j] + nums[k] < -nums[i]:
j += 1
else:
k -= 1
return list
if __name__ == '__main__':
s = Solution()
result_list = s.threeSum([-1, 0, 1, 2, -1, -4])
print(result_list)
运行结果1:
参考程序2:
class Solution(object):
def threeSum(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
resultlist = []
if len(nums) < 3:
return resultlist
nums.sort()
for i in range(0, len(nums)):
j = i + 1
k = len(nums) - 1
if i > 0 and nums[i] == nums[i - 1]:
continue #
while j < k:
sum = nums[i] + nums[j] + nums[k]
if sum == 0:
resultlist.append((nums[i], nums[j], nums[k]))
k -= 1
j += 1
while(nums[j] == nums[j - 1] and nums[k] == nums[k + 1] and j < k):
j += 1
elif sum > 0:
k -= 1
while(nums[k] == nums[k + 1] and j < k):
k -= 1
else:
j += 1
while(nums[j] == nums[j - 1] and j < k):
j += 1
return list(set(resultlist))
运行结果2:
参考程序3:
class Solution(object):
def threeSum(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
nums.sort()
rl = []
for k in range(len(nums) - 2):
if nums[k] > 0: #肯定不会超过buns
break
if k > 0 and nums[k] == nums[k - 1]:
continue #跳过已经存在的数组
i, j = k + 1, len(nums) - 1
while i < j:
s = nums[k] + nums[i] + nums[j]
if s < 0: #小了,前指针向后移
i += 1
while i < j and nums[i] == nums[i - 1]: i += 1#找到一个不一样的
elif s > 0:#大了,后指针向前移
j -= 1
while i < j and nums[j] == nums[j + 1]: j -= 1 #找到一个不一样的
else:
rl.append([nums[k], nums[i], nums[j]])
i += 1
j -= 1
while i < j and nums[i] == nums[i - 1]: i += 1 #找到一个不一样的
while i < j and nums[j] == nums[j + 1]: j -= 1 #找到一个不一样的
return rl
运行结果3: