algorithm002
diff --git a/‎Week_02/id_19/LeetCode_1_19.java‎
Lines changed: 15 additions & 0 deletions b/‎Week_02/id_19/LeetCode_1_19.java‎
Lines changed: 15 additions & 0 deletions
diff --git a/‎Week_02/id_19/LeetCode_242_19.java‎ b/‎Week_02/id_19/LeetCode_242_19.java‎
@@ -0,0 +1,15 @@
+class Solution {
+    public int[] twoSum(int[] nums, int target) {
+        int[] res = new int[2];
+        for(int i=0;i<nums.length;i++) {
+            for(int j=i+1;j<nums.length;j++) {
+                if (nums[i] + nums[j] == target) {
+                    res[0] = i;
+                    res[1] = j;
+                    return res;
+                }
+            } 
+        }
+        return res;
+    }
+}