原题链接:18. 4Sum
欢迎优化!
【思路】
本题考查动态规划。如果四次循环时间复杂度为O(n4),先排序 O(nlogn) ,实现复杂度为O(n3)。具体实现是需要4个指针 i, j, left, right,先固定 i、 j,然后用2sum得方法寻找到left和right,假设sum = nums[i] + nums[j] + nums]left] + nums[right]。由于数组是有序的,如果sum = target,那么left右移,right左移;如果sum > target,那么right;如果sum < target,那么left右移:
public List<List<Integer>> fourSum(int[] nums, int target) {
List<List<Integer>> result = new ArrayList<List<Integer>>();
Arrays.sort(nums);
for (int i = 0; i < nums.length - 3; i++) {
if (i != 0 && nums[i] == nums[i - 1])
continue;
for (int j = i + 1; j < nums.length - 2; j++) {
if (j != i + 1 && nums[j] == nums[j - 1])
continue;
int left = j + 1;
int right = nums.length - 1;
while (right > left) {
int sum = nums[i] + nums[j] + nums[left] + nums[right];
if (sum == target) {
ArrayList<Integer> temp = new ArrayList<Integer>();
temp.add(nums[i]);
temp.add(nums[j]);
temp.add(nums[left]);
temp.add(nums[right]);
result.add(temp);
while (left < right && nums[left] == nums[left + 1]) left++;
while (left < right && nums[right] == nums[right - 1]) right--;
}
if (sum <= target) left++;
if (sum >= target) right--;
}
}
}
return result;
}
282 / 282
test cases passed. Runtime: 59 ms Your runtime beats 47.90% of javasubmissions.
欢迎优化!