1. Two Sum

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

Example:

 

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

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

java实现

public class Solution {
    public int[] twoSum(int[] nums, int target) {
       List<Integer> intList=new ArrayList();
        for(int i=0;i<nums.length;i++){
            for(int j=0;j<i;j++){
                if(nums[i]+nums[j]==target){
                    intList.add(j);
                    intList.add(i);
                }
            }

        }
        Integer[] ints=intList.toArray(new Integer[intList.size()]);
        int[] intArray = new int[ints.length];
        for(int i=0; i < ints.length; i ++)
        {
            intArray[i] = ints[i].intValue();
        }
        return intArray;
        
    }
}