Skip to content

Commit 1cf0fc8

Browse files
author
Victor An
committed
restart learn leetcode
1 parent cbb0999 commit 1cf0fc8

File tree

2 files changed

+29
-6
lines changed

2 files changed

+29
-6
lines changed

pom.xml

Lines changed: 11 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -7,16 +7,21 @@
77
<groupId>me.anduo</groupId>
88
<artifactId>jiuzhang</artifactId>
99
<version>1.0-SNAPSHOT</version>
10-
10+
<properties>
11+
<maven.compiler.source>11</maven.compiler.source>
12+
<maven.compiler.target>11</maven.compiler.target>
13+
</properties>
1114
<build>
1215
<sourceDirectory>src</sourceDirectory>
1316
<plugins>
1417
<plugin>
15-
<artifactId>maven-compiler-plugin</artifactId>
16-
<configuration>
17-
<source>1.8</source>
18-
<target>1.8</target>
19-
</configuration>
18+
<groupId>org.apache.maven.plugins</groupId>
19+
<artifactId>maven-compiler-plugin</artifactId>
20+
<version>3.8.1</version>
21+
<configuration>
22+
<source>11</source>
23+
<target>11</target>
24+
</configuration>
2025
</plugin>
2126
</plugins>
2227
</build>

src/solutions/P0001_Two_Sum.java

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
package solutions;
2+
3+
import java.util.HashMap;
4+
5+
public class P0001_Two_Sum {
6+
7+
public int[] twoSum(int[] nums, int target) {
8+
var remainIndexMap = new HashMap<Integer, Integer>();
9+
for (int i = 0; i < nums.length; i++) {
10+
if (remainIndexMap.containsKey(nums[i])) {
11+
return new int[]{remainIndexMap.get(nums[i]), i};
12+
}
13+
remainIndexMap.put(target - nums[i], i);
14+
}
15+
return new int[]{-1, -1};
16+
}
17+
18+
}

0 commit comments

Comments
 (0)