Movatterモバイル変換

[0]ホーム
URL:

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

 Sign up
Appearance settings

Commit00009d9

Browse files
refactor 18
1 parent3f89915 commit00009d9

File tree

2 files changed

+52
-28
lines changed

2 files changed

+52
-28
lines changed

‎src/main/java/com/fishercoder/solutions/_18.java

Lines changed: 29 additions & 28 deletions
Original file line numberDiff line numberDiff line change
@@ -23,43 +23,44 @@
2323

2424
publicclass_18 {
2525

26-
publicList<List<Integer>>fourSum(int[]nums,inttarget) {
27-
List<List<Integer>>result =newArrayList();
28-
if (nums ==null ||nums.length ==0) {
29-
returnresult;
30-
}
31-
Arrays.sort(nums);
32-
for (inti =0;i <nums.length -3;i++) {
33-
if (i >0 &&nums[i -1] ==nums[i]) {
34-
continue;
26+
publicstaticclassSolution1 {
27+
publicList<List<Integer>>fourSum(int[]nums,inttarget) {
28+
List<List<Integer>>result =newArrayList();
29+
if (nums ==null ||nums.length ==0) {
30+
returnresult;
3531
}
36-
for (intj =i +1;j <nums.length -2;j++) {
37-
if (j >i +1 &&nums[j -1] ==nums[j]) {
32+
Arrays.sort(nums);
33+
for (inti =0;i <nums.length -3;i++) {
34+
if (i >0 &&nums[i -1] ==nums[i]) {
3835
continue;
3936
}
40-
intleft =j +1;
41-
intright =nums.length -1;
42-
while (left <right) {
43-
intsum =nums[i] +nums[j] +nums[left] +nums[right];
44-
if (sum ==target) {
45-
result.add(Arrays.asList(nums[i],nums[j],nums[left],nums[right]));
46-
while (left +1 <right &&nums[left] ==nums[left +1]) {
37+
for (intj =i +1;j <nums.length -2;j++) {
38+
if (j >i +1 &&nums[j -1] ==nums[j]) {
39+
continue;
40+
}
41+
intleft =j +1;
42+
intright =nums.length -1;
43+
while (left <right) {
44+
intsum =nums[i] +nums[j] +nums[left] +nums[right];
45+
if (sum ==target) {
46+
result.add(Arrays.asList(nums[i],nums[j],nums[left],nums[right]));
47+
while (left +1 <right &&nums[left] ==nums[left +1]) {
48+
left++;
49+
}
50+
while (right -1 >left &&nums[right] ==nums[right -1]) {
51+
right--;
52+
}
4753
left++;
48-
}
49-
while (right -1 >left &&nums[right] ==nums[right -1]) {
5054
right--;
55+
}elseif (sum >target) {
56+
right--;
57+
}else {
58+
left++;
5159
}
52-
left++;
53-
right--;
54-
}elseif (sum >target) {
55-
right--;
56-
}else {
57-
left++;
5860
}
5961
}
6062
}
63+
returnresult;
6164
}
62-
returnresult;
6365
}
64-
6566
}
Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
packagecom.fishercoder;
2+
3+
importcom.fishercoder.common.utils.CommonUtils;
4+
importcom.fishercoder.solutions._18;
5+
importorg.junit.BeforeClass;
6+
importorg.junit.Test;
7+
8+
publicclass_18Test {
9+
privatestatic_18.Solution1solution1;
10+
privatestaticint[]nums;
11+
12+
@BeforeClass
13+
publicstaticvoidsetup() {
14+
solution1 =new_18.Solution1();
15+
}
16+
17+
@Test
18+
publicvoidtest1() {
19+
nums =newint[]{1,0, -1,0, -2,2};
20+
CommonUtils.printListList(solution1.fourSum(nums,0));
21+
}
22+
23+
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp