题目：

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].

我的答案-java：

class Solution {

    public int[] twoSum(int[] nums, int target) {

        int index_0 = 0;

        int index_1 = 1;

        for(int i = 0;i<nums.length;i++){

            for(int j = 0;j <nums.length;j++){

                if(nums[i]+nums[j] == target){

                    index_0 = i;

                    index_1 = j;

                }

            }

        }

        int []result ={index_0,index_1};

        return result;

    }

}