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.

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

//基于二分查找思想，在nums中查找是否存在target
class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int front=0;
        int rear=nums.size()-1;
        int mid=0;
        while (front <= rear) {
            mid = (front+rear)/2;
            if (nums[mid] < target)
                front = mid+1;
            else if(nums[mid]>target){
                rear = mid-1;
            }
            else{
                return mid;
            }
        }
        return front;
    }
};