[Leetcode]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. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9

Output: index1=1, index2=2

同之前的two sum题类似，用C的话少不了遍历，但是对于有序表来说可以缩短时间；

思路：

1.先找到第一个大于TARGET的数，或者找到target本身，记录其INDEX

2.采用TWO SUM顺序遍历的方法计算和是否等于TARGET

3.注意INDEX是以非零开始的

int* twoSum(int* numbers, int numbersSize, int target, int* returnSize) {
    if(numbers == NULL || numbersSize <= 1){
    	*returnSize = 0;
    	return NULL;
    }
    
    int left, mid, right;
    int *retArray = NULL;
    
    left = 0;
    right = numbersSize - 1;
    
    while(left < right){
    	mid = (right + left )/2;
    	
    	if(numbers[mid] == target){
    		left = mid;
	    	break;
	    }
    	
    	if(numbers[mid] > target){
	    	right = mid;
	    }
	    else{
    		left = mid + 1;
    	}
    }

    int i, j;
    for(i = 0; i < left; i++){
    	for(j = i + 1; j <= left; j ++){
   	 		if((numbers[i] + numbers[j]) == target){
	    		goto out;
	    	}
    	}
    }
 
 err:
	*returnSize = 0;
	return NULL;
	
 out:   
 
    retArray = malloc(sizeof(int) * 2);
    if(retArray == NULL){
    	*returnSize = 0;
    	return NULL;	
    }

	retArray[0] = i + 1;
	retArray[1] = j + 1;
	*returnSize = 2;
	
	return retArray;
}

2.使用两个指针

int* twoSum(int* numbers, int numbersSize, int target, int* returnSize) {
     int *retArray = NULL;
    
	if(numbers == NULL || numbersSize <= 0){
    	*returnSize = 0;
    	return NULL;
    }
    
    int i, j, tmp;
    
    i = 0;
    j = numbersSize - 1;
    
    while(i < j){
    	tmp = numbers[i] + numbers[j];
    	
    	if(tmp < target){
	    	i ++;
	    }
	    else if(tmp > target){
    		j --;	
    	}
    	else{
	    	goto out;	
	    }
    }
    
out:   
 
    retArray = malloc(sizeof(int) * 2);
    if(retArray == NULL){
    	*returnSize = 0;
    	return NULL;	
    }

	retArray[0] = i + 1;
	retArray[1] = j + 1;
	*returnSize = 2;
	
	return retArray;   
    
}