class Solution {
public int[] twoSum(int[] nums, int target) {
int len=nums.length;
Map<Integer,Integer> map= new HashMap<Integer,Integer>(len);
map.put(nums[0],0);
for(int i=1;i<len;i++){
if(map.containsKey(target-nums[i])){
return new int[]{i,map.get(target-nums[i])};
}else{
map.put(nums[i],i);
}
}
return new int[0];
}
}轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/330137.html
標籤：其他