java 版本
public static int[] towSum(int[] nums,int target){
if (nums.length == 0) return null;
Map map = new HashMap<Integer, Integer>();
for (int i = 0; i <nums.length ; i++) {
if(map.containsKey(target-nums[i])){
return new int[]{(int)map.get(target-nums[i]),i};
}
map.put(nums[i],i);
}
return null;
}
python:
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
targs = {}
for i,n in enumerate(nums):
if targs.__contains__(target-n):
return [targs[target-n],i]
targs[n]=i
return None