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.
《剑指offer》
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n)
{
if (head == NULL) return NULL;
// if (n ==1) return head;
ListNode * pAHead = head;
ListNode * pBehind = NULL; //要删除节点的前一个节点
ListNode * pdelete = NULL; //要删除的节点
for (int i = 0; i < n -1 ; ++i)
{
pAHead = pAHead->next;
}
if (pAHead->next != NULL)
{
pAHead = pAHead->next;
pBehind = head;
pdelete = pBehind->next;
}
else
return pBehind->next;
while (pAHead->next != NULL)
{
pAHead = pAHead->next;
pBehind = pBehind->next;
pdelete = pdelete->next;
}
pBehind->next = pdelete->next;
delete(pdelete);
return head;
}
};