leetcode 18. 4Sum

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

Subscribe to see which companies asked this question.

public class Solution {
    public List<List<Integer>> fourSum(int[] nums, int target) {
        List<List<Integer>> list=new LinkedList<>();
        Arrays.sort(nums);
        Set<String> set=new HashSet<>();
        for(int i=0;i<nums.length-3;i++){
            int temptarget=target-nums[i];
            for(int j=i+2;j<nums.length-1;j++){
                int low=i+1;
                int high=nums.length-1;
                int temp=nums[j];
                while(low<j&&high>j){
                    if(temp+nums[low]+nums[high]<temptarget){
                        low++;
                    }else if(temp+nums[low]+nums[high]>temptarget){
                        high--;
                    }else  if(temp+nums[low]+nums[high]==temptarget){
                        List<Integer>templist=new LinkedList<>();
                        templist.add(nums[i]);
                        templist.add(nums[low]);
                        templist.add(nums[j]);
                        templist.add(nums[high]);
                        String str=nums[i]+" "+nums[low]+" "+nums[j]+" "+nums[high]+"";
                        if(!set.contains(str)){
                            set.add(str);
                            list.add(templist);
                        }
                        if(j-low>1){
                            low++;
                        }else{
                            high--;
                        }
                    }
                }
            }
        }
        return list;
    }
}