void deleteKNode(ListNode *head,int i, int k)
{
ListNode *p, *q;
int a,b;
for (a = 0, p = head; a < i; a++,p = p->next)
{
if (p == null)//结点不够i个则无需删除,直接退出
return;
}
for (b = 0, q = p; b < k; b++, q = p->next)
{
if(q == null) //已经删到了表尾,直接退出无需继续删除
return;
p->next = q->next; //删除当前结点并释放
free(q);
}
}
温馨提示:答案为网友推荐,仅供参考