-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path18. 4Sum
39 lines (39 loc) · 1.19 KB
/
18. 4Sum
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
class Solution
{
public List<List<Integer>> fourSum(int[] nums, int target)
{
Arrays.sort(nums);
List<List<Integer>> l = new ArrayList<List<Integer>>();
if(nums.length<4)
return l;
for(int i=0;i<nums.length;i++)
{
for(int j=i+1;j<nums.length;j++)
{
int k=j+1;
int m=nums.length-1;
//System.out.println(nums[i]+" "+nums[j]+" "+nums[k]+" "+nums[m]);
while(m>k)
{
if(nums[i]+nums[j]+nums[k]+nums[m]>target)
m--;
else if(nums[i]+nums[j]+nums[k]+nums[m]<target)
k++;
else
{
List<Integer> s= new ArrayList<Integer>();
s.add(nums[i]);
s.add(nums[j]);
s.add(nums[k]);
s.add(nums[m]);
if(!l.contains(s))
l.add(s);
m--;
k++;
}
}
}
}
return l;
}
}