力扣链接:四数之和
题目描述
给你一个由 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
输入:[1000000000,1000000000,1000000000,1000000000]
target = -294967296
输出:[]
Java代码
class Solution {
public List<List<Integer>> fourSum(int[] nums, int target) {
List<List<Integer>> result = new ArrayList<>();
Arrays.sort(nums);
//if (nums[0] == 1000000000)
//return new ArrayList<>();
for (int i = 0; i < nums.length-2; i++) {
if (i > 0 && nums[i - 1] == nums[i]) {
continue;
}
for (int j = i + 1; j < nums.length-1; j++) {
if (j > i + 1 && nums[j - 1] == nums[j]) {
continue;
}
int left = j + 1;
int right = nums.length - 1;
while (right > left) {
if ((long)nums[i] + nums[j] + nums[left] + nums[right] > target) {
right--;
} else if ((long)nums[i] + nums[j] + nums[left] + nums[right] < target) {
left++;
} else {
result.add(Arrays.asList(nums[i], nums[j], nums[left], nums[right]));
while (right > left && nums[right] == nums[right - 1]) right--;
while (right > left && nums[left] == nums[left + 1]) left++;
left++;
right--;
}
}
}
}
return result;
}
}
python代码
class Solution:
def fourSum(self, nums, target):
nums.sort()
n = len(nums)
res = []
for i in range(n-3):
if i > 0 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
l = j + 1
r = n - 1
while l < r:
if nums[i] + nums[j] + nums[l] + nums[r] > target: r -= 1
elif nums[i] + nums[j] + nums[l] + nums[r] < target: l += 1
else:
res.append([nums[i], nums[j], nums[l], nums[r]])
while l < r and nums[l] == nums[l + 1]: l += 1
while l < r and nums[r] == nums[r - 1]: r -= 1
l += 1
r -= 1
return res
做题心得
1、要彻底弄明白三数之和。四数之和就是加了曾for循环嵌套,本质上还是双指针+遍历。
2、要特别注意示例2溢出问题,用long转换。