LeetCode - 4Sum
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.
Note:
Elements in a quadruplet (a,b,c,d) must be in non-descending order. (ie, a ≤ b ≤ c ≤ d)
The solution set must not contain duplicate quadruplets.For example, given array S = {1 0 -1 0 -2 2}, and target = 0. A solution set is: (-1, 0, 0, 1) (-2, -1, 1, 2) (-2, 0, 0, 2)
My solution is as following:
class Solution:
# @param {integer[]} nums
# @param {integer} target
# @return {integer[][]}
def fourSum(self, nums, target):
i, nums, result = 0, sorted(nums), []
while i < len(nums) - 3:
j = i + 1
while j < len(nums) - 2:
k, l = j + 1, len(nums) - 1
while k < l:
if nums[i] + nums[j] + nums[k] + nums[l] < target:
k += 1
elif nums[i] + nums[j] + nums[k] + nums[l] > target:
l -= 1
else:
result.append((nums[i], nums[j], nums[k], nums[l]))
k, l = k + 1, l - 1
while k < l and nums[k] == nums[k - 1]:
k += 1
while k < l and nums[l] == nums[l + 1]:
l -= 1
j += 1
while j < len(nums) - 1 and nums[j] == nums[j - 1]:
j += 1
i += 1
while i < len(nums) - 1 and nums[i] == nums[i - 1]:
i += 1
return result