一、原题
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
二、中文
给定一个整数数组,找出其中两个数满足相加等于你指定的目标数字。
要求:这个函数twoSum必须要返回能够相加等于目标数字的两个数的索引,且index1必须要小于index2。请注意一点,你返回的结果(包括index1和index2)都不是基于0开始的。你可以假设每一个输入肯定只有一个结果。
三、思路
(1)对数组使用先排序后处理的方式,这样效率比较高
(2)排序后怎么保证原来的下标(index)呢,这要构建一个辅助类,让数组的值和下标相对应起来
(3)排序后分别从两边让两个指针向中间移动,当两树相加之和大于目标时,右指针向左移动,反之左指针向右移动
四、程序
package LeetCode;
import java.util.Arrays;
public class Leetcode001 {
// 创建一个辅助类,目的是实现数组排序时下标的排放
private static class Node implements Comparable<Node>{
int value;
int index;
public Node(int value, int index){
this.value = value;
this.index = index;
}
@Override
public int compareTo(Node o) {
return this.value - o.value;
}
}
public static int[] twoSum(int num[], int target){
// 用于保存要返回的结果
int result[] = {0, 0};
//[1]创建辅助类的数组,并将num[]的值存入其中
Node[] tmp = new Node[num.length];
for(int i = 0; i < num.length; i++){
tmp[i] = new Node(num[i], i);
}
//[2]对辅助数组进行排序
Arrays.sort(tmp);
//[3]从两边向中间赶
int left = 0;
int right = num.length - 1;
while(left < right){
//如果找到的话
if(tmp[left].value + tmp[right].value == target){
if(tmp[left].index > tmp[right].index){
result[0] = tmp[right].index + 1;
result[1] = tmp[left].index + 1;
}
else{
result[0] = tmp[left].index + 1;
result[1] = tmp[right].index + 1;
}
break;
}
//如果没有找到的话
else if(tmp[left].value + tmp[right].value > target){
right--;
}
//如果
else if(tmp[left].value + tmp[right].value < target){
left++;
}
}
return result;
}
//测试程序
public static void main(String args[]){
int number[] = {2, 20, 7, 11};
int result[] = twoSum(number, 9);
System.out.println("index1 = "+result[0]+" index2 = "+result[1]);
}
}
index1 = 1 index2 = 3