leetcode #18. 4Sum

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]
]

思路
和3sum思路一样，只不过在其中多加了一个for循环
sum变为 int sum = nums[i]+nums[j]+nums[start]+nums[end];
并且需要一个while 语句去辨别是否有重复的数字如果有
其实题目并不难比较麻烦
思路很清晰

class Solution {
    public List<List<Integer>> fourSum(int[] nums, int target) {
        
        Arrays.sort(nums);
        List<List<Integer>> res =new ArrayList<>();
       
        int length=nums.length;
        if(length<4)return res;
        
        for(int i = 0;i<length-3;i++){
            if(i>0&&nums[i]==nums[i-1]){
                continue;
            }
            
            for(int j = i+1;j<length-2;j++){
            int start = j+1,end =nums.length-1;
           
            if(j>i+1&&nums[j]==nums[j-1]){
                continue;
            }
            
            while(start < end){
                 int sum = nums[i]+nums[j]+nums[start]+nums[end];
                    
                    
                    if(sum>target){
                        end --;
                        while(start<end&&nums[end]==nums[end+1])end--;
                    }
                    else if(sum<target){
                        start++;
                        while(start<end&&nums[start]==nums[start-1])start++;
                    }
                    else{
                        List<Integer> temp =new ArrayList<>();
                       temp.add(nums[i]);
                        temp.add(nums[j]);
                        temp.add(nums[start]);
                        temp.add(nums[end]);
                        res.add(temp);
                        start++;
                        end--;
                          while(start<end&&nums[end]==nums[end+1])end--;
                         while(start<end&&nums[start]==nums[start-1])start++;
                    }
                    
                    
                }
            }
        }
        
        return res;
    }
}