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.
/**
* 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* cur = head;
ListNode* removed;
for (int i = 1; i <= n; ++i) {
cur = cur->next;
}
if (cur == NULL) {
removed = head;
head = head->next;
}
else {
ListNode* pre_removed = head;
cur = cur->next;
while (cur != NULL) {
cur = cur->next;
pre_removed = pre_removed->next;
}
removed = pre_removed->next;
pre_removed->next = pre_removed->next->next;
}
delete removed;
return head;
}
};