leetcode 35. Search Insert Position

class Solution {public:int searchInsert(vector<int>& nums, int target){auto res = upper_bound(nums.begin(), nums.end(), target);if (res == nums.begin()){return 0;}res--;if (*res == target){return res - nums.begin();}else{return res - nums.begin() + 1;}}};