leetcode 35. Search Insert Position 二分查找

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Example 1:

Input: [1,3,5,6], 5
Output: 2
Example 2:

Input: [1,3,5,6], 2
Output: 1
Example 3:

Input: [1,3,5,6], 7
Output: 4
Example 4:

Input: [1,3,5,6], 0
Output: 0

标准二分查找

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int n=nums.size();
        int lo=0,hi=n;
        while(lo<hi){
            int mi=(lo+hi)/2;
            if(nums[mi]>=target)hi=mi;
            else lo=mi+1;
        }
        return lo;
    }
};