class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int n = nums.size();
if (n == 0)
return 0;
if (target > nums[n-1])
return n;
int beg = 0, end = n - 1;
while (beg < end) {
int mid = beg + (end - beg) / 2;
if (target > nums[mid]) {
beg = mid + 1;
} else {
end = mid;
}
}
return beg;
}
};
35. 搜索插入位置的个人题解
最新推荐文章于 2024-08-06 00:07:27 发布