18. 四数之和(javascript)18. 4Sum

给你一个由 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
你可以按 任意顺序 返回答案 。

Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that:

0 <= a, b, c, d < n
a, b, c, and d are distinct.
nums[a] + nums[b] + nums[c] + nums[d] == target
You may return the answer in any order.

示例 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]]

参考官方解题：
https://leetcode.cn/problems/4sum/solution/si-shu-zhi-he-by-leetcode-solution/

全部的代码

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[][]}
 */
var fourSum = function (nums, target) {
    const resList = [];
    if (nums.length < 4) {
        return resList;
    }
    nums.sort((a, b) => a - b);
    const len = nums.length;
    for (let i = 0; i < len - 3; i++) {
        if (i > 0 && nums[i] == nums[i - 1]) {
            continue
        }
        if (nums[i] + nums[i + 1] + nums[i + 2] + nums[i + 3] > target) {
            break
        }
        for (let j = i + 1; j < len - 2; j++) {
            if (j > i + 1 && nums[j] == nums[j - 1]) {
                continue
            }
            if (nums[i] + nums[j] + nums[j + 1] + nums[j + 2] > target) {
                break
            }
            let l = j + 1
            let r = len - 1
            while (l < r) {
                let sum = nums[i] + nums[j] + nums[l] + nums[r]
                if (sum == target) {
                    resList.push([nums[i], nums[j], nums[l], nums[r]])
                    while (l < r && nums[l] == nums[l + 1]) l++
                    while (l < r && nums[r] == nums[r - 1]) r--
                    l++
                    r--

                } else if (sum < target) {
                    l++

                } else if (sum > target) {
                    r--

                }

            }

        }
    }
    return resList;

};

不考虑重复的数组项

var fourSum = function (nums, target) {
    const resList = []
    if (nums.length < 4) {
        return resList
    }
    let len = nums.length
    nums.sort((a, b) => a - b)
    //因为考虑到是四个数，所以遍历到 -倒数第四项
    for (let i = 0; i < len - 3; i++) {
        //因为考虑到是四个数，所以遍历到 -倒数第三项
        for (let j = i + 1; j < len - 2; j++) {
            let l = j + 1
            let r = len - 1
            while (l < r) {
                const sum = nums[i] + nums[j] + nums[l] + nums[r]
                if (sum == target) {
                    resList.push([nums[i], nums[j], nums[l], nums[r]])
                    l++
                    r--
                } else if (sum > target) {
                    r--
                } else if (sum < target) {
                    l++
                }
            }
        }
    }
    return resList
};

添加-重复项过滤

var fourSum = function (nums, target) {
    const resList = []
    if (nums.length < 4) {
        return resList
    }
    let len = nums.length
    nums.sort((a, b) => a - b)
    for (let i = 0; i < len - 3; i++) {
    	//i遇到和上一项相同的数，跳过
        if (i > 0 && nums[i] == nums[i - 1]) {
            continue
        }
        for (let j = i + 1; j < len - 2; j++) {
            //j遇到和上一项相同的数，跳过
            if (j > i + 1 && nums[j] == nums[j - 1]) {
                continue
            }
            let l = j + 1
            let r = len - 1
            while (l < r) {
                const sum = nums[i] + nums[j] + nums[l] + nums[r]
                if (sum == target) {
                    resList.push([nums[i], nums[j], nums[l], nums[r]])
                    //l遇到和下一项相同的数，跳过当前项,因为左指针下一项往右走，和l+1比较
                    while (l < r && nums[l] == nums[l + 1]) l++
                    //r遇到和下一项相同的数，跳过当前项,因为右指针下一项往左走，和r-1比较
                    while (l < r && nums[r] == nums[r - 1]) r--
                    l++
                    r--
                } else if (sum > target) {
                    r--
                } else if (sum < target) {
                    l++
                }
            }
        }
    }
    return resList
};

将上面的代码进行优化，标注的是新添加的

var fourSum = function (nums, target) {
    const resList = []
    if (nums.length < 4) {
        return resList
    }
    let len = nums.length
    nums.sort((a, b) => a - b)
    for (let i = 0; i < len - 3; i++) {
        if (i > 0 && nums[i] == nums[i - 1]) {
            continue
        }
        //因为数组是升序排列，当遇到当前数、后三位连续的数之和大于目标值，就不用进行循环了
        if (nums[i] + nums[i + 1] + nums[i + 2] + nums[i + 3] > target) {
            break
        }
        for (let j = i + 1; j < len - 2; j++) {
            if (j > i + 1 && nums[j] == nums[j - 1]) {
                continue
            }
            //因为数组是升序排列，当遇到当前数、后三位连续的数之和大于目标值，就不y用进行循环了
            if (nums[i] + nums[j] + nums[j + 1] + nums[j + 2] > target) {
                break
            }
            let l = j + 1
            let r = len - 1
            while (l < r) {
                const sum = nums[i] + nums[j] + nums[l] + nums[r]
                if (sum == target) {
                    resList.push([nums[i], nums[j], nums[l], nums[r]])
                    while (l < r && nums[l] == nums[l + 1]) l++
                    while (l < r && nums[r] == nums[r - 1]) r--
                    l++
                    r--
                } else if (sum > target) {
                    r--
                } else if (sum < target) {
                    l++
                }
            }
        }
    }
    return resList
};

leetcode:https://leetcode.cn/problems/4sum/