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.
这道题的思路:利用递归的回溯来判断
初始代码如下:
public ListNode removeNthFromEnd(ListNode head,int n){
removeNode(head,n,0);
return head;
}
public int removeNode(ListNode head,int n,int sum){
if(head.next==null){
return 1;
}
sum=removeNode(head.next, n,sum)+1;
if(sum-1==n){
head.next=head.next.next;
}
return sum;
}
错误1:
忘记判断特殊条件,对输入的一个节点,n=1的情况没有考虑
修正:
if(head.next==null&&n==1){
return null;
}
错误2:
给出的算法没有考虑边界
修正:
if(removeNode(head,n,0)==n){
return head.next;
};
正确代码如下:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode removeNthFromEnd(ListNode head,int n){
//当只有一个节点时,且n=1
if(head.next==null&&n==1){
return null;
}
//当删除的是第一个节点时
if(removeNode(head,n,0)==n){
return head.next;
};
return head;
}
//利用递归的回溯,来判断倒数第n个,为了只使用一个指针,我的判断条件是对倒数第n+1个进行操作
public int removeNode(ListNode head,int n,int sum){
if(head.next==null){
return 1;
}
sum=removeNode(head.next, n,sum)+1;
if(sum-1==n){
head.next=head.next.next;
}
return sum;
}
}