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.
简单做法:先遍历一遍,得到总结点数m,再遍历m-n-1个节点,删除倒数第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) {
ListNode* p=head;
ListNode* q=head;
if(n<1)
return q;
int m=0;
while(p){
p=p->next;
m++;
}
m=m-n;
if(m==0)
{
q=q->next;
return q;
}
while(--m){
q=q->next;
}
q->next=q->next->next;
return head;
}
};
仅遍历一遍:遍历一遍则需要使用递归遍历,先读到最后一个节点,再进行操作计数,对于删除第一个节点需要特殊处理,即head=head->next;但我们遍历后,在rm递归中无法确认一个节点是否是第一个节点,所以需要计数,当节点数i等于n时,此时为第一个节点,进行head后移即可
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode* p=head;
if(n<1)
return p;
if(head->next==NULL&&n==1){
head=NULL;
return head;
}
int i=rm(p,n);
if(i==n)
head=head->next;
return head;
}
int rm(ListNode* p,int n){
if(p==NULL)
return 0;
else{
int rank= rm(p->next,n)+1;
if(rank==n+1){
p->next=p->next->next;
}
return rank;
}
}
};