EvanJames的专栏

Be Real. Be Yourself.

题目：

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.

题意：

   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.

算法分析：

Use fast and slow pointers. The fast pointer is n steps ahead of the slow pointer. When the fast reaches the end, the slow pointer points at the previous element of the target element.

AC代码：

public class Solution
{
public ListNode removeNthFromEnd(ListNode head, int n)
{
return null;

for(int i=0; i<n; i++)
{
fast = fast.next;
}

//if remove the first node
if(fast == null)
{
}

while(fast.next != null)
{
fast = fast.next;
slow = slow.next;
}

slow.next = slow.next.next;

}
}

【LeetCode-面试算法经典-Java实现】【019-Remove Nth Node From End of List（移除单链表的倒数第N个节点）】

2015-07-22 07:24:29

LeetCode 19 : Remove Nth Node From End of List (Java)

2015-12-01 20:02:39

LeetCode:Remove Nth Node From End of List

2014-11-18 10:08:28

[leetcode] 19. Remove Nth Node From End of List python实现【easy】

2016-06-14 21:50:21

（Java）LeetCode-19. Remove Nth Node From End of List

2016-05-31 00:00:58

[LeetCode] 019. Remove Nth Node From End of List (Easy) (C++/Python)

2015-03-04 19:26:10

Remove Nth Node From End of List -- LeetCode

2014-02-23 23:39:11

【LeetCode】19 Remove Nth Node From End of List （c++实现）

2015-07-22 10:29:58

LeetCode19——Remove Nth Node From End of List

2015-02-05 15:07:55

[C语言][LeetCode][19]Remove Nth Node From End of List

2016-03-07 23:05:04

不良信息举报

[LeetCode][Java] Remove Nth Node From End of List