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.
Personal tips:用数组储存单链表顺序,然后根据下标删除,代码如下:
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
if (n == 0) return head;
vector<ListNode*> Nth;
ListNode *h = head;
while (h!=NULL)
{
Nth.push_back(h);
h = h->next;
}
if (Nth.size() == n) return head->next;
Nth.push_back(NULL);
Nth[Nth.size() - 2 - n]->next = Nth[Nth.size() - n];
return head;
}
};