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.
Code:
<span style="font-size:14px;">/**
* 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) {
int index = 0;
ListNode *begin = head;
while (head != NULL && index < n+1) {
head = head->next;
++index;
}
if (index != n+1) return begin->next;
ListNode *before = begin;
while (head != NULL) {
head = head->next;
before = before->next;
}
before->next = before->next->next;
return begin;
}
};</span>