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.
/**
* 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* h;
h = head;
int len = 0;
while(h != NULL)
{
h = h -> next;
len++;
}
if(len == 1) return NULL;
if(len == n)
{
head = head -> next;
return head;
}
h = head;
for(int i = 1; i <= len - n - 1; ++ i)
{
h = h -> next;
}
if(h -> next == NULL)
h -> next = NULL;
else
h -> next = h -> next -> next;
return head;
}
};