Repository navigation
Expand file tree
/
Copy pathFs.java
More file actions
61 lines (57 loc) · 2.06 KB
/
Copy pathFs.java
File metadata and controls
61 lines (57 loc) · 2.06 KB
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
package FourSum018;
import javafx.collections.transformation.FilteredList;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
/**
* Created by Administrator on 2017/8/27.
*/
public class Fs {
//方法1,利用三数求和的思想,先取两个数,另外两个左右夹逼靠近
public List<List<Integer>> fourSum(int[] nums,int target){
List<List<Integer>> res=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 j=i+1;j<nums.length-2;j++){
if(j!=i+1&&nums[j]==nums[j-1])
continue;
int left=j+1;
int right=nums.length-1;
while(left<right){
int sum=nums[i]+nums[j]+nums[left]+nums[right];
if(sum<target){
left++;
}else if(sum>target){
right--;
}else {
ArrayList<Integer> tmp=new ArrayList<Integer>();
tmp.add(nums[i]);
tmp.add(nums[j]);
tmp.add(nums[left]);
tmp.add(nums[right]);
res.add(tmp);
left++;
right--;
while(left<right&&nums[left]==nums[left-1]){
left++;
}
while(left<right&&nums[right]==nums[right+1]){
right--;
}
}
}
}
}
return res;
}
//方法2,使用二分法,把4数求和转换成2个2数求和
public static void main(String[] args){
int[] nums={1,0,-1,0,-2,2};
int target=0;
List<List<Integer>> res=new Fs().fourSum(nums,target);
System.out.print(res);
}
}