题目连接:Leetcode 035 Search Insert Position
解题思路:因为数组有序,所以直接进行二分查找即可。
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int l = 0, r = nums.size();
while (l + 1 < r) {
int mid = (l + r) >> 1;
if (nums[mid] <= target) l = mid;
else r = mid;
}
int ans = (l + r) >> 1;
if (target <= nums[ans]) return ans;
else return ans + 1;
}
};