From浙大mooc数据结构与算法
Ptr Reverse(Ptr head,int k)
{ int cnt=1;
new=head->next;
old=new->next;
while(cnt<k){
tmp=old->next;
old->next=new;
new=old;
old=tmp;
cnt++;
}
head->next->next=old;
return new;
}