四数之和
描述
- 给你一个由 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]]
提示
- 1 <= nums.length <= 200
- - 1 0 9 10^9 109 <= nums[i] <= 1 0 9 10^9 109
- - 1 0 9 10^9 109 <= target <= 1 0 9 10^9 109
Typescript 版算法实现
1 ) 方案1: 排序 + 双指针
function fourSum(nums: number[], target: number): number[][] {
const quadruplets = [];
if (nums.length < 4) {
return quadruplets;
}
nums.sort((x, y) => x - y);
const length = nums.length;
for (let i = 0; i < length - 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;
}
if (nums[i] + nums[length - 3] + nums[length - 2] + nums[length - 1] < target) {
continue;
}
for (let j = i + 1; j < length - 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;
}
if (nums[i] + nums[j] + nums[length - 2] + nums[length - 1] < target) {
continue;
}
let left = j + 1, right = length - 1;
while (left < right) {
const sum = nums[i] + nums[j] + nums[left] + nums[right];
if (sum === target) {
quadruplets.push([nums[i], nums[j], nums[left], nums[right]]);
while (left < right && nums[left] === nums[left + 1]) {
left++;
}
left++;
while (left < right && nums[right] === nums[right - 1]) {
right--;
}
right--;
} else if (sum < target) {
left++;
} else {
right--;
}
}
}
}
return quadruplets;
};
2 ) 方案2:排序+深度优先
function fourSum(nums: number[], target: number): number[][] {
const list = []
const len = nums.length
const tmp = []
nums.sort((a, b) => a - b)
function dfs(index, count, target) {
if (count === 0 && target === 0) {
list.push([...tmp])
return
}
// 剪枝
if (len - index < count) return
if (target < count * nums[index]) return
if (target > count * nums[len - 1]) return
for (let i = index; i < len; i++) {
if (i > index && nums[i] === nums[i - 1]) {
continue
}
tmp.push(nums[i])
dfs(i + 1, count - 1, target - nums[i])
tmp.pop()
}
}
dfs(0, 4, target)
return list
};
374



被折叠的 条评论
为什么被折叠?



