题目

Given an array of integers that is already sorted in ascending order, 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.

Note:

Your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution and you may not use the same element twice.
Example:

1
2
3
Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.

分析

较为简单
此题目只需保证 前后的两个目标值不重复,且后边的角标大于前面的,且从1开始计数。

C代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
int* twoSum(int* numbers, int numbersSize, int target, int* returnSize) {
int *re=(int*)malloc(2*sizeof(int));

for(int i=0;i<numbersSize;i++)
{
for(int j=i+1;j<numbersSize;j++)
{
if(numbers[i]+numbers[j]==target)
{
re[0]=i+1;
re[1]=j+1;
}
}
}
*returnSize=2;

return re;
}