35. Search Insert Position

二分法分类：

35. Search Insert Position

//Search Insert Position.cpp
#include<iostream>
#include<vector>
using namespace std;




class Solution {
public:


int bisearch(vector<int> & a,int be,int ed,int tar){
if(be==ed)
return be;
int mid=(be+ed)/2;
if(tar>a[mid])
return bisearch(a,mid+1,ed,tar);
return bisearch(a,be,mid,tar);


}    int searchInsert(vector<int>& nums, int target) {
        return bisearch(nums,0,nums.size()-1,target);
    }
};


int main(){
vector<int> a;
a.push_back(1);
a.push_back(3);
a.push_back(5);
a.push_back(6);
Solution b;
cout<<b.searchInsert(a,8)<<endl;
}