searchInsert

searchInsert.cpp

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