不考虑节点不存在的情况
class Solution {
public:ListNode *removeNthFromEnd(ListNode *head, int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
ListNode *cur = head,*pri=head;
while(n--){
cur = cur->next;
}
if(cur==NULL)
return head->next;
while(cur->next!=NULL){
cur = cur->next;
pri = pri->next;
}
pri->next = pri->next->next;
return head;
}
};