<span style="font-size:24px;">int searchInsert(vector<int> &A, int target) {
// write your code here
if(A.empty())
return 0;
else if(target<A[0])
return 0;
else if(target>A[A.size()-1])
return A.size();
for(int i=0;i<A.size();i++)
{
if(A[i]==target)
return i;
if(target>A[i]&&target<A[i+1])
return i+1;
}
}</span>
注意:判断首位情况