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
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17 |
public class Solution { public
int[] twoSum(int[] numbers, int
target) { int[] result = new
int[2]; int
length = numbers.length; Map<Integer, Integer> difference = new
HashMap<Integer, Integer>(); for(int
i = 0; i < length; ++i) difference.put(target - numbers[i], i); for(int
i = 0; i < length; ++i){ if(difference.containsKey(numbers[i]) && i != difference.get(numbers[i])){ result[0] = Math.min(i, difference.get(numbers[i])) + 1; result[1] = Math.max(i, difference.get(numbers[i])) + 1; break; } } return
result; }} |
leetcode--Two Sum,布布扣,bubuko.com
原文地址：http://www.cnblogs.com/averillzheng/p/3769075.html
