WEEK 01 solutions

Two sum solution

Author: JEONGBEOMKO

two-sum/JEONGBEOMKO.java

@@ -1,20 +1,25 @@
+package week01.twosum;
+
 import java.util.HashMap;
 import java.util.Map;
 
-class Solution {
-    public int[] twoSum(int[] nums, int target) {
-        Map<Integer, Integer> numberMap = new HashMap<>();
-        for (int i=0; i<nums.length; i++) {
-            numberMap.put(nums[i], i);
-        }
+public class JEONGBEOMKO {
 
-        for(int i=0; i<nums.length; i++) {
-            int operand = target - nums[i];
-            if (numberMap.containsKey(operand) && numberMap.get(operand) != i) { // 자기 자신은 제외
-                return new int[] { numberMap.get(target - nums[i]), i };
+    class Solution {
+        public int[] twoSum(int[] nums, int target) {
+            Map<Integer, Integer> numberMap = new HashMap<>();
+            for (int i=0; i<nums.length; i++) {
+                numberMap.put(nums[i], i);
             }
-        }
 
-        return new int[] {};
+            for(int i=0; i<nums.length; i++) {
+                int operand = target - nums[i];
+                if (numberMap.containsKey(operand) && numberMap.get(operand) != i) { // 자기 자신은 제외
+                    return new int[] { numberMap.get(target - nums[i]), i };
+                }
+            }
+
+            return new int[] {};
+        }
     }
 }