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

我的思路：这道题目比较简单，目前采用暴力求解法，也能满足时间复杂度的要求。

我的解决：

class Solution {
    public int[] twoSum(int[] nums, int target) {
        //int[] Result= {0,0};
        for (int i =0; i < nums.length-1; i++) {
            for (int j = i + 1; j < nums.length; j++){
                   if(nums[i] + nums[j] == target){
                         //Result[0] = i;
                         //Result[1] = j;
                       return new int[] {i,j};
                    }
                }
        }
       // return Result;
        throw new IllegalArgumentException("No two sum solution");
    }
}