C++ 代码
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int i;
int count=-1;
for( i=0;i<nums.size();i++)
{
if(nums[i]==target)
return i;
else if(target<nums[i] && count ==-1)
count=i;
}
if(count==-1)
return i;
return count ;
}
};