[leetcode-34]Search for a Range(C)

问题描述：
Given a sorted array of integers, find the starting and ending position of a given target value.

Your algorithm’s runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].

分析：使用二分法找到target，然后分别向左右扩展延伸。

代码如下：4ms

/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* searchRange(int* nums, int numsSize, int target, int* returnSize) {
    int left = 0;
    int right = numsSize-1;
    int mid;
    int start=-1;
    int end=-1;
    int val=-1;

    int *res = (int *)malloc(sizeof(int)*2);
    res[0] = -1;
    res[1] = -1;
    *returnSize = 2;

    while(left<=right){
        mid = (left+right)/2;
        val = nums[mid];
        if(val==target){
            break;
        }else if(val>target){
            right = mid-1;
        }else
            left = mid+1;
    }
    if(left>right)
        return res;
    //得到mid，左右延伸
    left = mid;
    right = mid;
    while(left>=0&&nums[left]==target) left--;
    while(right<numsSize&&nums[right] == target) right++;

    res[0] = left+1;
    res[1] = right-1;

    return res;
}