输入一个单向链表,输出该链表中倒数第k个结点,
链表的倒数第0个结点为链表的尾指针。
#include <stdio.h>
struct Node
{
int nKey;
struct Node* next;
};
struct Node *lastK(struct Node * head, int k)
{
if(k<0)
error("k < 0.\n");
struct Node *p=head,*pk=head;
for(; k>0; k--)
{
if(pk->next != NULL)
pk = pk->next;
else
return NULL;
}
while(pk->next != NULL)
{
p = p->next;
pk = pk->next;
}
return p;
}
int main(void)
{
return 0;
}