题目链接
法一(双指针)
public List<List<Integer>> fourSum(int[] nums, int target) {
List<List<Integer>> ans = new ArrayList<>();
Arrays.sort(nums);
for (int i = 0; i < nums.length; i++) {
if (i > 0 && nums[i] == nums[i - 1]) {
continue;
}
for (int j = i + 1; j < nums.length; j++) {
if (j > i + 1 && nums[j] == nums[j - 1]) {
continue;
}
int left = j + 1, right = nums.length - 1;
while (left < right) {
long sum = (long) nums[i] + (long) nums[j] + (long) nums[left] + (long) nums[right];
if (sum < target) {
left++;
} else if (sum > target) {
right--;
} else {
ans.add(Arrays.asList(nums[i], nums[j], nums[left], nums[right]));
while (left < right && nums[left] == nums[left + 1]) {
left++;
}
while (left < right && nums[right] == nums[right - 1]) {
right--;
}
left++;
right--;
}
}
}
}
return ans;
}
法二(双指针 + 剪枝)
public List<List<Integer>> fourSum_2(int[] nums, int target) {
List<List<Integer>> ans = new ArrayList<>();
Arrays.sort(nums);
for (int i = 0; i < nums.length; i++) {
if (nums[i] > target && (nums[i] >= 0 || target >= 0)) {
break;
}
if (i > 0 && nums[i] == nums[i - 1]) {
continue;
}
for (int j = i + 1; j < nums.length; j++) {
if (nums[i] + nums[j] > target && (nums[i] + nums[j] >= 0 || target >= 0)) {
break;
}
if (j > i + 1 && nums[j] == nums[j - 1]) {
continue;
}
int left = j + 1, right = nums.length - 1;
while (left < right) {
long sum = (long) nums[i] + (long) nums[j] + (long) nums[left] + (long) nums[right];
if (sum < target) {
left++;
} else if (sum > target) {
right--;
} else {
ans.add(Arrays.asList(nums[i], nums[j], nums[left], nums[right]));
while (left < right && nums[left] == nums[left + 1]) {
left++;
}
while (left < right && nums[right] == nums[right - 1]) {
right--;
}
left++;
right--;
}
}
}
}
return ans;
}
本地测试
lay.showTitle(18);
Solution18 sol18 = new Solution18();
int[] nums18 = new int[]{1,0,-1,0,-2,2};
int target18 = 0;
List<List<Integer>> ans18_1 = sol18.fourSum(nums18, target18);
List<List<Integer>> ans18_2 = sol18.fourSum_2(nums18, target18);
arrayOpt.showIntLists(ans18_1);
arrayOpt.showIntLists(ans18_2);