就很简单啦,因为不用考虑别的乱七八糟的条件,哈希表就可以了
public int[] twoSum(int[] nums, int target) {
Map<Integer,Integer> map= new HashMap<>();
int a[]=new int[2];
for(int i=0;i<nums.length;i++){
if(map.containsKey(target-nums[i])){
a[0]=i;
a[1]=map.get(target-nums[i]);
}
map.put(nums[i],i);
}
return a;
}