public class Solution {
public List<List<Integer>> fourSum(int[] num, int target) {
HashSet<List<Integer>> quadruplets = new HashSet<List<Integer>>();
if(num.length < 4) {
return new ArrayList<List<Integer>>(quadruplets);
}
Arrays.sort(num);
for(int i = 0; i < num.length - 3; i++) {
for(int j = num.length - 1; j > i + 2; j--) {
// Two pointers scan
int left = i + 1, right = j - 1;
while(left < right) {
int sum = num[i] + num[j] + num[left] + num[right];
if(sum == target) {
List<Integer> quadruplet = new ArrayList<Integer>();
quadruplet.add(num[i]);
quadruplet.add(num[left]);
quadruplet.add(num[right]);
quadruplet.add(num[j]);
quadruplets.add(quadruplet);
left++;
right--;
} else if(sum < target) {
left++;
} else {
right--;
}
}
}
}
return new ArrayList<List<Integer>>(quadruplets);
}
}
Time: O(n^3)
Space: O(1)