解题思路:
(1)传统遍历法
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
for(int i=0;i<nums.size();i++) {
if(nums[i]>=target) return i;
}
return nums.size();
}
};
(2)快捷二分法
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int i = 0,j = nums.size()-1,mid;
while(i<=j) {
mid = (i+j)/2;
if(nums[mid]==target) return mid;
else if(nums[mid]<target) i=mid+1;
else j=mid-1;
}
return i;
}
};