去掉倒数第n的节点
题目
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.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
这是写节点可以构成一个单向链表,所以无法回头!
算法
采用两个引用,一快一慢,中间的间隔为给出的n,所以当快的那个到了末尾,那么慢的那个的下一个元素就指向了要去除的元素了。
虽然看起来挺简单,但是实现起来并不容易,边界条件还是比较多的,但是我写完之后看了下面那个代码,我就发现,真是太机智了!
代码
public class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
ListNode start = new ListNode(0);
ListNode slow = start, fast = start;
slow.next = head;
//Move fast in front so that the gap between slow and fast becomes n
for(int i=1; i<=n+1; i++) {
fast = fast.next;
}
//Move fast to the end, maintaining the gap
while(fast != null) {
slow = slow.next;
fast = fast.next;
}
//Skip the desired node
slow.next = slow.next.next;
return start.next;
}
}
他在开始新建了一个节点,所以避免了很多不必要的特殊条件的判断。大家可以自己尝试一下,然后自己输入一些数据验证一下。