We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 35fe0fa commit 501f47dCopy full SHA for 501f47d
Arrays/15_3Sum.java
@@ -0,0 +1,32 @@
1
+class Solution {
2
+ public List<List<Integer>> threeSum(int[] nums) {
3
+ List<List<Integer>> result = new ArrayList<>();
4
+
5
+ Arrays.sort(nums);
6
7
+ for (int i = 0; i < nums.length; i++) {
8
+ if (i > 0 && nums[i] == nums[i - 1]) { continue; }
9
10
+ int j = i + 1, k = nums.length - 1;
11
12
+ while (j < k) {
13
+ int sum = nums[i] + nums[j] + nums[k];
14
15
+ if (sum == 0) {
16
+ result.add(Arrays.asList(nums[i], nums[j], nums[k]));
17
+ ++j;
18
19
+ while (j < k && nums[j] == nums[j-1]) {
20
21
+ }
22
+ } else if (sum > 0) {
23
+ --k;
24
+ } else {
25
26
27
28
29
30
+ return result;
31
32
+}
0 commit comments