leetcode 34.在排序数组中查找元素的第一个和最后一个位置（find first and last position of element in sorted array）C语言

1.description

https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/description/

给定一个按照升序排列的整数数组 nums，和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。

你的算法时间复杂度必须是 O(log n) 级别。

如果数组中不存在目标值，返回 [-1, -1]。

示例 1:

输入: nums = [5,7,7,8,8,10], target = 8
输出: [3,4]

示例 2:

输入: nums = [5,7,7,8,8,10], target = 6
输出: [-1,-1]

2.solution

二分查找变体：查找第（最后）一个等于给定值的元素，两者结合就是本题求的。注：如果第一次返回-1了，第二次二分就不必调用了。

int search_first(int *nums, int numsSize, int target){
    int low = 0, high = numsSize - 1;
    
    while(low <= high){
        int mid = low + ((high - low)>>1);
        if(nums[mid] < target){
            low = mid + 1;
        }else if(nums[mid] > target){
            high = mid - 1;
        }else{
            if(mid == 0 || nums[mid-1] != target){
                return mid;
            }else{
                high = mid - 1;
            }
        }
    }

    return -1;
}


int search_last(int *nums, int numsSize, int target){
    int low = 0, high = numsSize - 1;

    while(low <= high){
        int mid = low + ((high - low)>>1);
        if(nums[mid] < target){
            low = mid + 1;
        }else if(nums[mid] > target){
            high = mid - 1;
        }else{
            if(mid == numsSize-1 || nums[mid+1] != target){
                return mid;
            }else{
                low = mid + 1;
            }
        }
    }

    return -1;
}


int* searchRange(int* nums, int numsSize, int target, int* returnSize){
    int *res = (int*)malloc(2*sizeof(int));
    *returnSize = 2;
    res[0] = search_first(nums, numsSize, target);
    if(res[0] == -1){
        res[1] = -1;
    }else{
        res[1] = search_last(nums, numsSize, target);
    }
    
    return res;
}