LeetCode:Search Insert Position

Search Insert Position

My Submissions

Question

Total Accepted: 84219  Total Submissions: 232667  Difficulty: Medium

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.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

二分查找

code:

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