6.四数之和-难点

# 难在去重和剪枝！| LeetCode：18. 四数之和
# 给你一个由n个整数组成的数组nums ，和一个目标值target 。
# 请你找出并返回满足下述全部条件且不重复的四元组[nums[a], nums[b], nums[c], nums[d]] （若两个四元组元素一一对应，则认为两个四元组重复）：
#
# 0 <= a, b, c, d < n
# a、b、c和d互不相同
# nums[a] + nums[b] + nums[c] + nums[d] == target
# 你可以按任意顺序返回答案 。

#
# 示例1：
# 输入：nums = [1, 0, -1, 0, -2, 2], target = 0
# 输出：[[-2, -1, 1, 2], [-2, 0, 0, 2], [-1, 0, 0, 1]]
#
# 示例2：
# 输入：nums = [2, 2, 2, 2, 2], target = 8
# 输出：[[2, 2, 2, 2]]


nums = [1, 0, -1, 0, -2, 2]
target = 0

nums = [2, 2, 2, 2, 2]
target = 8


nums = [-2, -1, -1, 1, 1, 2, 2]
target = 0


def get_combinations(nums, target):
    nums = sorted(nums)
    res = []
    if nums[0] > 0 and sum(nums) < target:
        return []

    for i in range(len(nums)-3):
        if i > 0 and nums[i] == nums[i-1]:
            continue
        for j in range(i+1, len(nums)-2):
            if j > i + 1 and nums[j] == nums[j - 1]:
                continue
            left = j+1
            right = len(nums)-1

            while left < right:
                tem_sum = nums[i] + nums[j] + nums[left] + nums[right]
                # print(tem_sum)
                if tem_sum - target > 0:
                    right -= 1
                    while left < right and nums[right] == nums[right+1]:
                        right -= 1
                elif tem_sum - target < 0:
                    left += 1
                    while left < right and nums[left] == nums[left-1]:
                        left += 1
                else:
                    res.append([nums[i], nums[j], nums[left], nums[right]])
                    left += 1
                    right -= 1
                    while left < right and nums[left] == nums[left-1]:
                        left += 1
                    while left < right and nums[right] == nums[right+1]:
                        right -= 1
    return res


print(get_combinations(nums, target))