Question
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.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.
public int[] twoSum(int[] nums, int target) {
int[] numsNew = new int[nums.length];
System.arraycopy(nums, 0, numsNew, 0, nums.length);
Arrays.sort(numsNew);
int smallerCusor = 0;
int largerCusor = numsNew.length - 1;
// //去除数组中大于target的元素
// while(numsNew[largerCusor] > target)
// largerCusor--;
//从有序数组的两端往中间搜索
while (smallerCusor < largerCusor) {
if (numsNew[smallerCusor] + numsNew[largerCusor] == target)
break;
else if (numsNew[smallerCusor] + numsNew[largerCusor] > target)
largerCusor--;
else
smallerCusor++;
}
int s = 0;
int l = numsNew.length -1;
//分别从数组的两端开始搜索两个加数的下标
while(nums[s++] != numsNew[smallerCusor]);
while(nums[l--] != numsNew[largerCusor]);
return new int[]{s-1, l+1};
}
说明
由于Arrays.sort()对基本类型数据使用快速排序,对象数组使用归并排序,所以算法复杂度为O(nlogn);
代码中注释掉的两行是因为nums数组中可能会有负数,所以不能预先排除掉一部分元素;
从数组的两端开始搜索下标的原因在于,这两个加数有可能相等。当然,也可以只从一端开始搜索,需要多写一些判断语句;
测试发现返回数组中两个下标的顺序没有要求;
本文解法的runtime位于所有AC的答案的89%,应该还有更好的解题思路,这里只是练习一下,就不去费脑找最优解了