【leetcode】(python) 18. 4Sum详解

Description

18. 4Sum Medium
    Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.

Note:

The solution set must not contain duplicate quadruplets.

Example

Given array nums = [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]
]

题目大意

给定一整数数组，求其中四数之和等于给定目标值。

解题思路

类似3Sum解题，只不过多一层循环，另外注意避免重复结果。
先将nums数组排序，然后确定四个数的位置：最左端定第一个数，也就是第一层循环；次左端定第二个数（第二层循环），第三个数从3号位开始，第四个数从最右端开始，第三个数和第四个数视作左右双指针。

code

class Solution:
    def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
        res = []
        nums.sort()
        N = len(nums)
        for i in range(N - 3):
            if i and nums[i] == nums[i - 1]:
                continue
            for j in range(i + 1, N - 2):
                if j > i + 1 and nums[j] == nums[j - 1]:
                    continue
                left = j + 1
                right = N - 1
                while left < right:
                    sum4 = nums[i] + nums[j] + nums[left] + nums[right]
                    if sum4 == target:
                        res.append([nums[i], nums[j], nums[left],nums[right]])
                        left += 1
                        while left < right and nums[left] == nums[left - 1]:   
                            left += 1
                    elif sum4 < target:
                        left += 1
                    else:
                        right -= 1
        return res