lintcode:First Position of Target

原创

mb63887cf57331d 2022-12-01 18:22:20 ©著作权

©著作权归作者所有：来自51CTO博客作者mb63887cf57331d的原创作品，请联系作者获取转载授权，否则将追究法律责任

For a given sorted array (ascending order) and a target number, find the first index of this number in O(log n) time complexity.

If the target number does not exist in the array, return -1.

Example
If the array is [1, 2, 3, 3, 4, 5, 10], for given target 3, return 2.

1.方法1：搜索左闭右闭区间

注意求中间值尽量避免使用（l+r）/2，因为l+r可能会溢出；
所以尽量用l+(r-l)/2这样就中间值；

class Solution {
public:
    /**
     * @param nums: The integer array.
     * @param target: Target number to find.
     * @return: The first position of target. Position starts from 0. 
     */
    int binarySearch(vector<int> &array, int target) {
        // write your code here
        int l=0,r=array.size()-1;
        while(l<=r){
            int mid=l+(r-l)/2;
            if(target==array[mid]){
                if(mid==0){
                    return mid;
                }else if(array[mid]!=array[mid-1]){
                    return mid;
                }else{
                    r=mid-1;
                }
            }else if(target<array[mid]){
                r=mid-1;
            }else{
                l=mid+1;
            }
        }

        return -1;
    }
};

2.方法2：搜索左闭右开空间

class Solution {
public:
    /**
     * @param nums: The integer array.
     * @param target: Target number to find.
     * @return: The first position of target. Position starts from 0. 
     */
    int binarySearch(vector<int> &array, int target) {
        // write your code here

        int l=0,r=array.size();//
        while(l<r){//
            int mid=l+(r-l)/2;
            if(target<=array[mid]){
                r=mid;//
            }else{
                l=mid+1;
            }
        }

        if(array[l]==target){
            return l;
        }

        return -1;
    }
};