Difficulty: easy
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) {
if(head==NULL)
return NULL;
ListNode* x=head;
ListNode* y=head;
ListNode* y1=NULL;
for(int i=0;i<n-1;i++)
x = x->next;
while(x->next!=NULL){
y1 = y;
x = x->next;
y = y->next;
}
if(y1==NULL){
head = y->next;
delete y;
}
else{
y1->next = y->next;
delete y;
}
return head;
}
};