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
53 lines (45 loc) · 1.57 KB

File metadata and controls

53 lines (45 loc) · 1.57 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
package Algorithms.sequence;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class ThreeSum {
public List<List<Integer>> threeSum(int[] num) {
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]) {
continue;
}
// 创建二个指针,分别从2头查找,查目标值,它们2个加起来要等于0-num1
int l = i + 1;
int r = len - 1;
while (l < r) {
int sum = num[i] + num[l] + num[r];
if (sum == 0) {
ArrayList<Integer> list = new ArrayList<Integer>();
list.add(num[i]);
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 < 0) {
l++;
} else {
r--;
}
}
}
return ret;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.