Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution:
- """
- @param numbers: Give an array numbers of n integer
- @return: Find all unique triplets in the array which gives the sum of zero.
- """
- def threeSum(self, nums):
- res = []
- nums.sort()
- for i in range(len(nums)-2):
- if i > 0 and nums[i] == nums[i-1]:
- continue
- l, r = i+1, len(nums)-1
- while l < r:
- s = nums[i] + nums[l] + nums[r]
- if s < 0:
- l +=1
- elif s > 0:
- r -= 1
- else:
- res.append((nums[i], nums[l], nums[r]))
- while l < r and nums[l] == nums[l+1]:
- l += 1
- while l < r and nums[r] == nums[r-1]:
- r -= 1
- l += 1; r -= 1
- return res
Add Comment
Please, Sign In to add comment