题解 | #牛群的位置排序#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param labels int整型vector 
     * @param target int整型 
     * @return int整型
     */
    int searchInsert(vector<int>& labels, int target) {
        // write code here

        // 二分查找
        int left = 0;
        int right = labels.size()-1;
        
        while(left<=right)
        {
            int mid = (left+right)/2;

            if(labels[mid]==target)
                return mid;

            if(labels[mid] < target)
                left = mid+1;
            
            if(labels[mid] > target)
                right = mid-1;
        }

        return left;
    }
};