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) { if(head==NULL || n<=0) return NULL; ListNode* pA = head; ListNode* pB = head; while(n--) { pA = pA->next; } if(pA==NULL) return head->next; while(pA->next!=NULL) { pA = pA->next; pB = pB->next; } if(pB->next!=NULL) { pB->next = pB->next->next; } return head; } };