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.

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

這道題的思路是這樣的，只要每個數都和其他的數相加並比較是否為目標值便可以了，程式碼如下：

public  int[] twoSum(int[] nums, int target) {
        int []add={0,1};
        for(int i=0;i<nums.length-1;i++){
        	for(int j=i+1;j<nums.length;j++){
        		if(nums[i]+nums[j]==target){
        			add[0]=i;
        			add[1]=j;
        		}
        	}
        }
        return add;
    }