题目来源:力扣
**总结:利用count计算有多少个结点在利用i使指针移动到要被删除的前一个结点 **
typedef struct list{
int val;
struct list *pnext;
}NODE,*PNODE;
PNODE sort(PNODE pHead,int n){
int count=0,i=0;
PNODE p=pHead->pnext,s=pHead;
while(p!=NULL){
p=p->pnext;
count++;
}
while(i!=count-n){
s=s->pnext;
i++;
}
s->pnext=s->pnext->pnext;
return pHead;
}