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.
想法很笨拙,直接将链表先遍历完,然后将链表节点放到一个数组里面;最后依据下标删除。
唯一需要讨论的是给定的N是否是头节点。
/**
* 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) {
vector<ListNode*> tempList;
ListNode* temp = head;
while(temp != 0)
{
tempList.push_back(temp);
temp = temp->next;
}
if( head != tempList[tempList.size() - n])
{
tempList[tempList.size() - n - 1]->next = tempList[tempList.size() - n]->next;
return head;
}
else
{
head = head->next;
return head;
}
}
};
然后在网上看到了一种利用双指针的方法。http://www.2cto.com/kf/201310/251457.html
大概的想法是设两个指针,一个指针P指向当前,一个指针q指向后第N个。若q为空,则说明已到最末尾,那么当前指针P为需删除的。相对来说,这个方法简单些,并且不耗内存。