class Solution {
public List<List<Integer>> fourSum(int[] nums, int target) {
List<List<Integer>> result = new ArrayList<List<Integer>>();
Arrays.sort(nums);
for(int i = 0; i < nums.length - 3; i++)
{
if(i > 0 && nums[i] == nums[i - 1]) continue;
for(int k = i + 1; k < nums.length - 2; k++)
{
if(k > i + 1 && nums[k] == nums[k - 1]) continue;
int left = k + 1, right = nums.length - 1;
while(left < right)
{
int sum = nums[i] + nums[k] + nums[left] + nums[right];
if(sum > target)
{
while(right > left && nums[right] == nums[--right]);
}
else if(sum < target)
{
while(left < right && nums[left] == nums[++left]);
}
else
{
result.add(Arrays.asList(nums[i], nums[k], nums[left], nums[right]));
while(right > left && nums[right] == nums[--right]);
while(left < right && nums[left] == nums[++left]);
}
}
}
}
return result;
}
}