2017算法课.05（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

左和右二分，得mid，循环来遍历整个vector

利用了二分思想

#include <iostream>
#incldue <string.h>
#include <vector>

using namespace std;

int searchInsert(vector<int>& nums, int target){
 int i = 0;
 int j = nums.size()- 1;
 
 while (i <= j){
  int mid = (int)((i+j)/2);
  if(nums[mid] == target){
   return mid;
  }
  else if(nums[mid]>target){
   j = mid - 1;
  }
  else{
   i = mid +1;
  }

 }
   return i;
}