typedef struct node{
int data;
struct Node * next;
} NODE,*PNODE;
NODE* Findlastth(NODE*head,int N) //找寻链表中倒数第N个节点
{
int k=N;
NODE*p,*q;
p=q=head->next;
while(k>1)
{
q=q->next;
k--;
}
if(q->next==NULL)
return p;
while(q->next)
{
p=p->next;
q=q->next;
}
return p;
}
/**************************/