-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path3sum.java
More file actions
86 lines (83 loc) · 3.08 KB
/
3sum.java
File metadata and controls
86 lines (83 loc) · 3.08 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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
public class Solution {
public ArrayList<ArrayList<Integer>> threeSum(int[] num) {
// Start typing your Java solution below
// DO NOT write main() function
Arrays.sort(num);
ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
HashSet<ArrayList<Integer>> tripletSet = new HashSet();
int numSize = num.length;
if (numSize < 3) return result;
for (int i = 0; i < numSize - 2; i++) {
int first = i + 1;
int last = numSize - 1;
int target = 0 - num[i];
while (first < last) {
int sumTwo = num[first] + num[last];
if (sumTwo < target) first++;
else if (sumTwo > target) last--;
else {
ArrayList<Integer> triplet = new ArrayList<Integer>();
triplet.add(num[i]);
triplet.add(num[first]);
triplet.add(num[last]);
// Avoid duplicates
if (tripletSet.add(triplet)) result.add(triplet);
first++;
last--;
}
}
}
return result;
}
}
// Don't use set to avoid duplicate.
import java.util.ArrayList;
import java.util.Arrays;
public class Solution {
public ArrayList<ArrayList<Integer>> threeSum(int[] num) {
// Start typing your Java solution below
// DO NOT write main() function
Arrays.sort(num);
ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
//HashSet tripletSet = new HashSet();
int numSize = num.length;
if (numSize < 3) return result;
for (int i = 0; i < numSize - 2; ) {
int first = i + 1;
int last = numSize - 1;
int target = 0 - num[i];
while (first < last) {
int sumTwo = num[first] + num[last];
if (sumTwo < target) first++;
else if (sumTwo > target) last--;
else {
ArrayList<Integer> triplet = new ArrayList<Integer>();
triplet.add(num[i]);
triplet.add(num[first]);
triplet.add(num[last]);
result.add(triplet);
// Avoid duplicates
while (first + 1 < last && num[first] == num[first + 1]) {
// go to num[first + 1]
first++;
}
// skip last duplicate
first++;
while (last - 1 > first && num[last] == num[last - 1]) {
last--;
}
last--;
}
}
//Avoid duplicates
while (i + 1 < numSize && num[i + 1] == num[i]) {
i++;
}
i++;
}
return result;
}
}