题目描述
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个元素。
思路一:
使用一个容量为n的先进先出队列,直到最后一个元素压入队列,把队首元素删除。
思路二:
改进版,看了别人的程序,发现没有必要使用队列,用两个指针OK了。前一个指针指向n+1元素,删掉第n个元素。
思路三:
新建一个头结点指向head,这样就可以不需要把“删掉head的情况”进行特殊处理了。代码链接
代码(思路一)
/**
* 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) {
queue<ListNode*> n_node;
ListNode* now_node = head;
ListNode* nplus1 = NULL;
for(int i = 0;i<n;i++)
{
n_node.push(now_node);
now_node = now_node->next;
}
while(now_node!=NULL)
{
nplus1 = n_node.front();
n_node.push(now_node);
n_node.pop();
now_node = now_node->next;
}
if(nplus1==NULL)
{
return head->next;
}
else
{
ListNode* nnode = n_node.front();
nplus1->next = nnode->next;
return head;
}
}
};
代码(思路二)
/**
* 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) {
queue<ListNode*> n_node;
ListNode* endnode = head;
ListNode* nplus1 = head;
for(int i = 0;i<n;i++)
{
endnode = endnode->next;
}
if(endnode == NULL)
{
nplus1 = nplus1->next;
delete head;
return nplus1;
}
else
{
while(endnode->next != NULL)
{
endnode = endnode->next;
nplus1 = nplus1->next;
}
ListNode* tobedelete = nplus1->next;
nplus1->next = nplus1->next->next;
delete tobedelete;
return head;
}
}
};