LeetCode--Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

Code Example:

 public static int[] twoSum(int[] nums, int target) {
        int[] k = new int[nums.length];
        for (int index = 0; index < nums.length - 1; index++) {
            for (int index2 = 1; index2 < nums.length; index2++) {
                int j = nums[index] + nums[index2];
                if (j == target && index != index2) {
                    for (int m = 0; m < k.length - 1; m++) {
                        k[m] = index;
                        k[m + 1] = index2;
                    }
                }
            }
        }
        return k;
    }
 public static void main(String[] args) {
        int[] nums = {2, 5, 5, 11, 8};
        int[] ret = twoSum(nums, 10);
        for (int m = 0; m < ret.length - 1; m++) {
            System.out.println("[" + ret[m] + "," + ret[m + 1] + "]");
        }
    }