@@ -0,0 +1,825 @@
+package TwoSum;%0A%0A%0A/**%0A * Given an array of integers, return indices of the two numbers such that they add up to a specific%0A * target.%0A *%0A * You may assume that each input would have exactly one solution, and you may not use the same%0A * element twice.%0A *%0A * Example: Given nums = %5B2, 7, 11, 15%5D, target = 9,%0A *%0A * Because nums%5B0%5D + nums%5B1%5D = 2 + 7 = 9, return %5B0, 1%5D.%0A */%0Apublic class Solution %7B%0A    public int%5B%5D twoSum(int%5B%5D nums, int target) %7B%0A        int n = nums.length;%0A%0A        int%5B%5D indices = new int%5B2%5D;%0A%0A        for (int i = 0; i %3C n; i++) %7B%0A            for (int j = i + 1; j %3C n; j++) %7B%0A                if (nums%5Bi%5D + nums%5Bj%5D == target) %7B%0A                    indices%5B0%5D = i;%0A                    indices%5B1%5D = j;%0A                    return indices;%0A                %7D%0A            %7D%0A        %7D%0A        return null;%0A    %7D%0A%7D

1. Two Sum