update #001 solution

icafe · Jan 8, 2019 · ccb02ba · ccb02ba
1 parent 8cbc136
commit ccb02ba
Show file tree

Hide file tree

Showing 9 changed files with 35 additions and 339 deletions.
diff --git a/.gitignore b/.gitignore
@@ -1,2 +1,3 @@
 leetcode.iml
-java/java.iml
+/.idea/
+/bin/
diff --git a/README.md b/README.md
@@ -1,5 +1,3 @@
 Solution set for Leetcode online interview problems.
 
-Code compiled by Java7
-
 https://oj.leetcode.com/problems/
diff --git a/java/com.gocoder.leetcode/BinaryTreeLevelOrderTraversal.java b/java/com.gocoder.leetcode/BinaryTreeLevelOrderTraversal.java
diff --git a/java/com.gocoder.leetcode/BinaryTreeLevelOrderTraversalII.java b/java/com.gocoder.leetcode/BinaryTreeLevelOrderTraversalII.java
diff --git a/java/com.gocoder.leetcode/CountAndSay.java b/java/com.gocoder.leetcode/CountAndSay.java
diff --git a/java/com.gocoder.leetcode/PascalTriangle.java b/java/com.gocoder.leetcode/PascalTriangle.java
diff --git a/java/com.gocoder.leetcode/PascalTriangleII.java b/java/com.gocoder.leetcode/PascalTriangleII.java
diff --git a/java/com.gocoder.leetcode/ReverseInteger.java b/java/com.gocoder.leetcode/ReverseInteger.java
diff --git a/src/com/gocoder/leetcode/L0001.java b/src/com/gocoder/leetcode/L0001.java
@@ -0,0 +1,33 @@
+package com.gocoder.leetcode;
+
+import java.util.Arrays;
+import java.util.HashMap;
+
+/**
+ * 两数之和
+ *
+ * <p>#001 https://leetcode-cn.com/problems/two-sum/
+ *
+ * @author gocoder
+ */
+public class L0001 {
+
+    public int[] twoSum(int[] nums, int target) {
+        int len = nums.length;
+        HashMap<Integer, Integer> map = new HashMap<>(len);
+        for (int i = 0; i < len; ++i) {
+            if (map.containsKey(nums[i])) {
+                return new int[]{map.get(nums[i]), i};
+            }
+            map.put(target - nums[i], i);
+        }
+        return null;
+    }
+
+    public static void main(String[] args) {
+        L0001 solution = new L0001();
+        int[] nums = new int[]{2, 7, 11, 15};
+        int target = 9;
+        System.out.println(Arrays.toString(solution.twoSum(nums, target)));
+    }
+}