Given a linked list, remove the nth node from the end of list and return its head.
For example,
Given linked list: 1->2->3->4->5, and n = 2.
After removing the second node from the end, the linked list becomes 1->2->3->5.
Note:
Given n will always be valid.
Try to do this in one pass.
题意:删除从后往前的第n个节点,双指针问题,第一个指针指向首位,第二个指针指向第n+1位
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode *ptr1 = head, *ptr2 = head, *Pre = NULL;
for(int i = 0; i < n; ++i){
ptr2 = ptr2->next;
}
while(ptr2 != NULL){
Pre = ptr1;
ptr1 = ptr1->next;
ptr2 = ptr2->next;
}
if(Pre == NULL){
head = ptr1->next;
delete ptr1;
} else {
Pre->next = ptr1->next;
delete ptr1;
}
return head;
}
};