題目
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
著作權歸領扣網絡所有。商業(yè)轉載請聯(lián)系官方授權，非商業(yè)轉載請注明出處荧降。
解題思路
兩層循環(huán)遍歷數(shù)組邮旷，將數(shù)組內任意兩個數(shù)相加的結果比對。
代碼
```
class?Solution?{
????public?int[]?twoSum(int[]?nums,?int?target)?{
????????for?(int?i=0;i<nums.length;i++){
????????????for?(int?j=i+1;j<nums.length;j++){
????????????????if?(nums[i]+nums[j]==target){
????????????????????return?new?int[]{i,?j};
????????????????}
????????????}
? ? ? ?}
????????return?new?int[]{-1};
????}
}
```
