插入過程 讓 m_iLength+1不超過m_iSize
bool List::ListInsert(int i, int *e)
{
if(i<0||i<=m_iLength)
{
return false;
}
if(m_iLength+1>m_iSize)
{
return false;
}
for(int k=m_iLength-1;k>=i;k--)
{
m_pList[k+1] = m_pList[k];
}
m_pList[i] = *e;
m_iLength++;
return true;
}
