solve two sum problem

Author: sora0319

two-sum/sora0319.java

@@ -1,4 +1,23 @@
 import java.util.*;
+
+// 개선안
+class Solution {
+    public int[] twoSum(int[] nums, int target) {
+        Map<Integer,Integer> checkNums = new HashMap<>();
+
+        for(int i = 0; i < nums.length; i++){
+            if(checkNums.containsKey(target - nums[i])){
+                int place = checkNums.get(target - nums[i]);
+                return new int[]{place, i};
+            }
+            checkNums.put(nums[i], i);
+        }
+        return new int[]{};
+    }
+}
+
+
+// 초기 구성안
 class Solution {
     public int[] twoSum(int[] nums, int target) {
         Map<Integer,Integer> element = new HashMap<>();