题目:
Given an array of integers,
return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution,
and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
解法:
public class TwoSum_1 {
public int[] twoSum(int[] nums, int target) {
Map<Integer,Integer> map = new HashMap<Integer,Integer>();
int [] a = {0,0};
for(int i = 0;i<nums.length;i++){
if(map.containsKey(target-nums[i])){
a[0] = map.get(target-nums[i]);
a[1] = i;
}else {
map.put(nums[i], i);
}
}
return a;
}
public static void main(String[] args){
TwoSum_1 ts = new TwoSum_1();
}
}