class Solution {
public int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> map = new HashMap<>();
map.put(nums[0], 0);
for (int i = 1; i < nums.length; i++) {
int j = map.getOrDefault(target - nums[i], -1);
if (j == -1) {
map.put(nums[i], i);
} else {
return new int[]{i, j};
}
}
return null;
}
}
1. 两数之和
最新推荐文章于 2024-09-14 20:30:05 发布