3Sum
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
Constraints:
- -10^5 <= nums[i] <= 10^5
- 0 <= i < nums.length
- 0 <= j < nums.length
- 0 <= k < nums.length
- i != j
- i != k
- j != k
Examples:
Input: [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]
Explanation: The triplets that sum to zero are [-1, -1, 2] and [-1, 0, 1].
Solutions
Two Pointers
Time: O(n^2)Space: O(n)
The two pointers approach is used to solve this problem. First, the array is sorted. Then, for each element in the array, two pointers are used to find a pair of elements that sum to the negation of the current element. If the sum is less than zero, the left pointer is moved to the right. If the sum is greater than zero, the right pointer is moved to the left. If the sum is equal to zero, the triplet is added to the result and the pointers are moved.
def threeSum(nums):
nums.sort()
result = []
for i in range(len(nums) - 2):
if i > 0 and nums[i] == nums[i - 1]:
continue
left, right = i + 1, len(nums) - 1
while left < right:
total = nums[i] + nums[left] + nums[right]
if total < 0:
left += 1
elif total > 0:
right -= 1
else:
result.append([nums[i], nums[left], nums[right]])
while left < right and nums[left] == nums[left + 1]:
left += 1
while left < right and nums[right] == nums[right - 1]:
right -= 1
left += 1
right -= 1
return resultFollow-up:
4Sum
