class Solution {
public int[] twoSum(int[] nums, int target) {
HashMap<Integer, Integer> map = new HashMap<>();
for(int i=0;i<nums.length;i++){
if(map.containsKey(target-nums[i]))
return new int[]{map.get(target-nums[i]),i};
map.put(nums[i],i);
}
return null;
}
}
用map求解两数之和
最新推荐文章于 2024-07-25 09:37:37 发布