Skip to content

Commit ccb02ba

Browse files
author
gocoder
committed
update #001 solution
1 parent 8cbc136 commit ccb02ba

File tree

9 files changed

+35
-339
lines changed

9 files changed

+35
-339
lines changed

.gitignore

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,2 +1,3 @@
11
leetcode.iml
2-
java/java.iml
2+
/.idea/
3+
/bin/

README.md

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,3 @@
11
Solution set for Leetcode online interview problems.
22

3-
Code compiled by Java7
4-
53
https://oj.leetcode.com/problems/

java/com.gocoder.leetcode/BinaryTreeLevelOrderTraversal.java

Lines changed: 0 additions & 98 deletions
This file was deleted.

java/com.gocoder.leetcode/BinaryTreeLevelOrderTraversalII.java

Lines changed: 0 additions & 100 deletions
This file was deleted.

java/com.gocoder.leetcode/CountAndSay.java

Lines changed: 0 additions & 35 deletions
This file was deleted.

java/com.gocoder.leetcode/PascalTriangle.java

Lines changed: 0 additions & 41 deletions
This file was deleted.

java/com.gocoder.leetcode/PascalTriangleII.java

Lines changed: 0 additions & 28 deletions
This file was deleted.

java/com.gocoder.leetcode/ReverseInteger.java

Lines changed: 0 additions & 34 deletions
This file was deleted.

src/com/gocoder/leetcode/L0001.java

Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
package com.gocoder.leetcode;
2+
3+
import java.util.Arrays;
4+
import java.util.HashMap;
5+
6+
/**
7+
* 两数之和
8+
*
9+
* <p>#001 https://leetcode-cn.com/problems/two-sum/
10+
*
11+
* @author gocoder
12+
*/
13+
public class L0001 {
14+
15+
public int[] twoSum(int[] nums, int target) {
16+
int len = nums.length;
17+
HashMap<Integer, Integer> map = new HashMap<>(len);
18+
for (int i = 0; i < len; ++i) {
19+
if (map.containsKey(nums[i])) {
20+
return new int[]{map.get(nums[i]), i};
21+
}
22+
map.put(target - nums[i], i);
23+
}
24+
return null;
25+
}
26+
27+
public static void main(String[] args) {
28+
L0001 solution = new L0001();
29+
int[] nums = new int[]{2, 7, 11, 15};
30+
int target = 9;
31+
System.out.println(Arrays.toString(solution.twoSum(nums, target)));
32+
}
33+
}

0 commit comments

Comments
 (0)