1两数字之和为Target,找两个数字
class Solution {
public int[] twoSum(int[] nums, int target) {
HashMap<Integer,Integer> map=new HashMap<>();
for(int i=0;i<nums.length;i++){
int dec = target-nums[i];
if(map.containsKey(dec)){
return new int[]{map.get(dec),i};
}
else{
map.put(nums[i],i);
}
}
return new int []{-1,-1};
}
}