题目描述:
输入一个递增排序的数组和一个数字s,在数组中查找两个数,使得它们的和正好是s。如果有多对数字的和等于s,则输出任意一对即可。
示例 1:
输入:nums = [2,7,11,15], target = 9
输出:[2,7] 或者 [7,2]
示例 2:
输入:nums = [10,26,30,31,47,60], target = 40
输出:[10,30] 或者 [30,10]
限制:
1 <= nums.length <= 10^5
1 <= nums[i] <= 10^6
作者:Krahets
链接:https://leetcode-cn.com/leetbook/read/illustration-of-algorithm/5832fi/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
解答:
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* twoSum(int* nums, int numsSize, int target, int* returnSize){
int i = 0;
int j = 0;
int tmp = 0;
int *res = (int*)malloc(sizeof(int) * 2);
*returnSize = 2;
j = numsSize - 1;
while(i < j){
tmp = nums[i] + nums[j];
if(tmp > target){
j--;
}
else if(tmp < target){
i++;
}
else{
res[0] = nums[i];
res[1] = nums[j];
return res;
}
}
return NULL;
}
运行结果: