Leetcode 167. Two Sum II - Input array is sorted

Leetcode 167. Two Sum II - Input array is sorted

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:

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.

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* twoSum(int* numbers, int numbersSize, int target, int* returnSize){
    int i, j;
    for(i = 0; i < numbersSize; i++){
        scanf("%d", &numbers[i]);
    }
    scanf("%d", &target);
    i = 0;
    j = numbersSize - 1;
    while(numbers[i] + numbers[j] != target){
        if(numbers[i] + numbers[j] < target)
            i++;
        else j--;
    } 
        
    *returnSize = 2;
    int * result = (int*)malloc(sizeof(int)*2);
    result[0] = i + 1;
    result[1] = j + 1;
    return result;
}

语言：C语言
解题思路：本来要用双重嵌套循环直接暴力解题，但是因为超时的原因，所以参考了0_o_c的思路，利用单重while循环以及i++, j–来控制遍历数组，最终成功通过。接下来还会尝试用C++双指针来重写这道题目。