update

Author: genkimaru

src/main/java/com/leetcode/array/ArrayOne.java renamed to src/main/java/com/leetcode/array/DisappearedNumber.java

@@ -5,7 +5,7 @@
 import java.util.function.BiConsumer;
 import java.util.List;
 
-public class ArrayOne {
+public class DisappearedNumber {
     /**
      *
      * find the disappeared numbers in array

src/main/java/com/leetcode/hash/TwoSumS.java

@@ -0,0 +1,27 @@
+package com.leetcode.hash;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class TwoSumS {
+
+    public int[] twoSun(int[] nums , int target){
+        Map<Integer, Integer> map = new HashMap<>();
+        for (int i = 0; i < nums.length; i++) {
+            if (map.containsKey(target-nums[i])) {
+                return new int[]{i, map.get(target-nums[i])};
+            }
+            map.put(nums[i], i);
+        }
+        return new int[]{};
+    }
+
+    public static void main(String[] args) {
+        int[] arr = {2,5,7,9};
+        int[] ints = new TwoSumS().twoSun(arr, 7);
+        for(int i : ints){
+            System.out.println(i);
+        }
+
+    }
+}