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

373人阅读 评论(0)

## 题目：

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;

ListNode fast = head;
ListNode slow = head;

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;

}
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：230960次
• 积分：4590
• 等级：
• 排名：第6365名
• 原创：230篇
• 转载：99篇
• 译文：0篇
• 评论：13条
文章分类
最新评论