35

二分查找

#include <cstdio>
#include <iostream>
#include <set>  
#include <vector>
using namespace std;
    int searchInsert(vector<int>& nums, int target) {
        int low = 0,high = nums.size()-1;
        while(low<=high)
        {
          int mid ;
          mid =  low + (high-low)/2 ;//low+high 有可能溢出
          if (nums[mid]>target)
          {
              high = mid-1;
          }
          else 
          {
            low = mid+1;
          }
        }
        return low;
    }

int main()
{
   vector<int> a;  
   int x;
   for(int i=0;i<4;i++)
   {
      cin>>x;
      a.push_back(x);
   }
   int val;
   cin>>val;
   /*for ( int ix = 0; ix < a.size(); ++ix ) 
       cout << a[ ix ] <<endl;*/
   cout<<searchInsert(a,val)<<endl;
   return 0 ;
}