最近一直在面试,想把自己做的leetcode的答案都记录下来,方便查询和复习。
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
这道题可以和three sum, four sum结合起来做。
import java.util.HashMap;
public class Solution {
public int[] twoSum(int[] numbers, int target) {
int[] result = new int[2];
if(numbers == null || numbers.length <= 1) return result;
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
for(int i = 0; i < numbers.length; i++){
int current = numbers[i];
if(map.containsKey(current)){
result[0] = map.get(current) + 1;
result[1] = i + 1;
return result;
} else {
map.put(target - current, i);
}
}
return result;
}
}