35. Search Insert Position

 1 static int wing=[]()
 2 {
 3     std::ios::sync_with_stdio(false);
 4     cin.tie(NULL);
 5     return 0;
 6 }();
 7 
 8 class Solution 
 9 {
10 public:
11     int searchInsert(vector<int>& nums, int target) 
12     {
13         int sz=nums.size();
14         if(nums[sz-1]<target)
15             return sz;
16         int i=0;
17         while(nums[i]<target)
18             i++;
19         return i;
20     }
21 };