博主分享免费Java教学视频，B站账号：Java刘哥
Question
Given an array of integers nums and and integer target, return the 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]
My Answer
import java.util.Map;
import java.util.HashMap;
class Solution {
public int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> map = new HashMap<>();
for(int i=0; i<nums.length; i++) {
int num = nums[i];
if(map.get(target-num) != null) {
return new int[]{map.get(target-num), i};
}
map.put(num, i);
}
return new int[]{};
}
}
- 微信
- 交流学习，有偿服务
-
- 博客/Java交流群
- 资源分享，问题解决，技术交流。群号：590480292
-
您可以选择一种方式赞助本站
支付宝扫一扫赞助
微信钱包扫描赞助
赏