Solution 1:
class Solution {
public:
int searchInsert(vector<int>& nums, int target)
{
//Solution 1:
//特殊情况:数组为0,或者target小于等于数组第一个元素
if (nums.empty() || target <= nums[0])
return 0;
//一般情况:
int i;
for(i = 0; i < nums.size(); i++)
{
if(target <= nums[i])
break;
}
return i;
}
};