示例 1:
输入:nums = [2,7,11,15], target = 9
输出:[0,1]
解释:因为 nums[0] + nums[1] == 9 ,返回 [0, 1] 。
方法一:
public static int[] twoSum(int[] nums, int target) {
for (int i = 0;i < nums.length - 1; i++){
for (int j = i + 1; j< nums.length; j++){
if (nums[i] + nums[j] == target){
return new int[] {nums[i],nums[j]};
}
}
}
throw new IllegalFormatFlagsException("No two sum solution");
}
方法二:
public static int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> numsMap = new HashMap<>();
for (int i = 0; i< nums.length; i++){
if (numsMap.containsKey(target-nums[i])){
return new int[] {numsMap.get(target - nums[i]),i};
}
numsMap.put(nums[i],i);
}
throw new IllegalFormatFlagsException("No two sum solution");
}