Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
61 lines (50 loc) · 1.8 KB

File metadata and controls

61 lines (50 loc) · 1.8 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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 Algorithms.sequence;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class FourSum {
public List<List<Integer>> fourSum(int[] num, int target) {
List<List<Integer>> ret = new ArrayList<List<Integer>>();
if (num == null) {
return ret;
}
Arrays.sort(num);
int len = num.length;
for (int i = 0; i < len; i++) {
if (i > 0 && num[i] == num[i - 1]) {
// skip duplicate.
continue;
}
for (int j = i + 1; j < len; j++) {
if (j > i + 1 && num[j] == num[j - 1]) {
// skip duplicate.
continue;
}
int l = j + 1;
int r = len - 1;
while (l < r) {
int sum = num[i] + num[j] + num[l] + num[r];
if (sum == target) {
ArrayList<Integer> list = new ArrayList<Integer>();
list.add(num[i]);
list.add(num[j]);
list.add(num[l]);
list.add(num[r]);
ret.add(list);
do {
l++;
} while (l < r && num[l] == num[l - 1]);
do {
r--;
} while (l < r && num[r] == num[r + 1]);
} else if (sum < target) {
l++;
} else {
r--;
}
}
}
}
return ret;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.