target sum java_[LeetCode刷题]1.Two Sum 两数之和（Java）

题目

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

Example 1:

Input: nums = [2,7,11,15], target = 9

Output: [0,1]

Output: Because nums[0] + nums[1] == 9, we return [0, 1].

Example 2:

Input: nums = [3,2,4], target = 6

Output: [1,2]

Example 3:

Input: nums = [3,3], target = 6

Output: [0,1]

Constraints:

2 <= nums.length <= 103

-109 <= nums[i] <= 109

-109 <= target <= 109

Only one valid answer exists.

来源：力扣(LeetCode)

链接：https://leetcode-cn.com/problems/two-sum

著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

解题思路

两层循环遍历数组，将数组内任意两个数相加的结果比对。

代码

```

class Solution {

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

for (int i=0;i

for (int j=i+1;j

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

return new int[]{i, j};

}

}

}

return new int[]{-1};

}

}

```

仅作为自我学习记录