18. 4Sum

最新推荐文章于 2024-07-23 17:53:36 发布

ncst

最新推荐文章于 2024-07-23 17:53:36 发布

阅读量248

点赞数

分类专栏： leetcode 文章标签：合并 string class

本文链接：https://blog.csdn.net/sinat_32547403/article/details/78300062

版权

leetcode 专栏收录该内容

414 篇文章 1 订阅

订阅专栏

Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.

Note: The solution set must not contain duplicate quadruplets.

For example, given array S = [1, 0, -1, 0, -2, 2], and target = 0.

A solution set is:
[
  [-1,  0, 0, 1],
  [-2, -1, 1, 2],
  [-2,  0, 0, 2]
]

java

class Solution {
    public List<List<Integer>> fourSum(int[] nums, int target) {
        List<List<Integer>> list = new ArrayList<>();
        if (nums == null || nums.length < 4) {
            return list;
        }
        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;
                int value = 0;
                List<Integer> arr = new ArrayList<>();
                while (left < right) {
                    value = nums[left] + nums[right] + nums[i] + nums[j];
                    if (left < right && value > target) {
                        right--;
                    }
                    if (left < right && value < target) {
                        left++;
                    }
                    if (left < right && value == target) {
                        arr.add(nums[i]);
                        arr.add(nums[j]);
                        arr.add(nums[left]);
                        arr.add(nums[right]);
                        list.add(new ArrayList<Integer>(arr));
                        arr.clear();
                        left++;
                        right--;
                        while (left < right && nums[left] == nums[left - 1]) {
                            left++;
                        }
                        while (left < right && nums[right] == nums[right + 1]) {
                            right--;
                        }
                    }
                }
            }
        }
        return list;
    }
}