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

我的解：

Runtime: 8 ms, faster than 57.73% of C++ online submissions for Search Insert Position.

Memory Usage: 8.8 MB, less than 100.00% of C++ online submissions for Search Insert Position.

class Solution {
public:
    // 这是一个简单的二分查找问题
    int searchInsert(vector<int>& nums, int target) {
        int b = 0,e = nums.size() - 1;
        while(b <= e)
        {
            int mid = b + (e - b) / 2;
            if (nums[mid] == target)return mid;
            if (nums[mid] < target)
            {
                b = mid + 1;
            }   
            else
            {
                e = mid - 1;
            }
        }
        return b;
    }
};