Easy 10 Search Insert Position（35）

Description
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

Solution
有序查找，二分法。

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