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:
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2. 

/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* twoSum(int* numbers, int numbersSize, int target, int* returnSize) 
{
    *returnSize = 2;
    int low = 0; 
    int high = numbersSize - 1;
    
    while(low < high)
    {
        if(numbers[low] + numbers[high] < target)
        {
            low += 1;
        }
        else if(numbers[low] + numbers[high] > target)
        {
            high -= 1;
        }
        else
        {
            break;
        }
    }
    int *res=(int *)malloc(sizeof(int) * 2);
    res[0] = low + 1;
    res[1] = high + 1;
    
    return res;
}