leetcode --

题目描述

Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums 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.

Example:

Given array nums = [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]
]
题目难度：middle

AC代码

class Solution {
    public List<List<Integer>> fourSum(int[] nums, int target) {
        List<List<Integer>> resList = new ArrayList<>();
        if(nums == null || nums.length < 4) return resList;
        Arrays.sort(nums);
        int len = nums.length, low = 0, high = 0;
        for(int i = 0;i < len - 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; //一点小优化：提前结束，
            else if(nums[i] + nums[len - 1] + nums[len -  2] + nums[len - 3] < target) continue; //同上
            for(int j = i + 1;j < len - 2;j++){
                if(j > i +1 && nums[j] == nums[j - 1]) continue;
                if(nums[j] + nums[j + 1] + nums[j + 2] > target - nums[i]) break;
                else if(nums[j] + nums[len - 1] + nums[len -  2] < target - nums[i]) continue;
                low = j + 1;
                high = len - 1;
                while(low < high){
                    if(nums[i] + nums[j] + nums[low] + nums[high] == target){
                        resList.add(Arrays.asList(nums[i], nums[j], nums[low], nums[high]));
                        while(low < high && nums[low + 1] == nums[low]) low++;
                        while(low < high && nums[high] == nums[high -1]) high--;
                        low++;
                        high--;
                    }
                    else if(nums[i] + nums[j] + nums[low] + nums[high] < target) low++;
                    else high--;
                }
            }
        }
        return resList;
    }
}