LeetcodeOJ1 TwoSum

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[] a = new int[2];
        for(int i = 0;i<nums.length;i++)
        {
             for(int j = i+1; j<nums.length;j++)
             {
                if(nums[i]+nums[j]==target)
                {
                        a[0] = i;
                        a[1] = j;
                        return a;
                }
            }
            
        }
        throw new IllegalArgumentException("No two sum solution");
    }
}

TIPS:

(1)注意一些API的规范书写，比如获取数组的长度为nums.length;而在获得字符串的长度时，使用的是str.length().

(2)注意输入参数nums中的元素是正数和负数都要考虑的。