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

原创 2016年05月31日 00:00:58

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.


这道题我的思路是,用两个List存储数据,第一个存放读取的最后N(N<=n)个数,当达到n时,每存一个数就将第一个数放到第二个List的后面,从而保证第一个List只有n个数。这样,当遍历完之后,第一个List存放后n个数,第二个存放前面的数,需要删掉倒数第n个,就将第一个List的第二个数放在第二个List后面即可~代码如下:


public ListNode removeNthFromEnd(ListNode head, int n) {        
		int n1 = 1;
		ListNode list1 = new ListNode(head.val);
		ListNode list2 = new ListNode(head.val);
		head = head.next;
		ListNode head_1 = list1;
		ListNode head_2 = list2;
		while(head != null){
			ListNode node = new ListNode(head.val);
			list1.next = node;
			head = head.next;
			list1 = node;
			n1++;
			if(n1 > n){
				
				list2.next = head_1;
				list2 = head_1;
				head_1 = head_1.next;
			}
		}
		list2.next = head_1.next;
		return head_2.next;
    }

在网上看到还有一种想法是:设置两个指针first跟second。first指针先移动n步,若此时first指针为空,则表示要删除的是头节点,此时直接返回head->next即可。如果first指针不为空,则将两个指针一起移动,直到first指针指向最后一个节点,令second->next=second->next->next即可删除第你n个节点。

也蛮有道理哈,就不亲自实现了,反正第一种方法也很快了,只用了1ms





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

【019-Remove Nth Node From End of List(移除单链表的倒数第N个节点)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given a l...

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

解题思路:一开始我的做法是先遍历一遍取得长度,然后长度减去n就知道要删除正着数第几个元素,结果题目要求one pass。那就只能用两个指针,一个快指针先走n步,一个慢指针从头开始走,这样当快指针走到尾...

LeetCode 19 — Remove Nth Node From End of List(C++ Java Python)

题目:http://oj.leetcode.com/problems/remove-nth-node-from-end-of-list/ Given a linked list, remove t...

LeetCode 19之Remove Nth Node From End of List的Java题解(三种解法)

题目: Given a linked list, remove the nth node from the end of list and return its head. For e...

LeetCode 19 Remove Nth Node From End of List (C,C++,Java,Python)

Problem: Given a linked list, remove the nth node from the end of list and return its head. ...

[leetcode: Python]19. Remove Nth Node From End of List

Given a linked list, remove the nth node from the end of list and return its head.For example,Given ...
  • NXHYD
  • NXHYD
  • 2017年05月19日 08:28
  • 185

LeetCode-19 Remove Nth Node From End of List(移除尾部第N个节点)

LeetCode-19 Remove Nth Node From End of List Given a linked list, remove the nth node from the end o...

Leetcode 19. Remove Nth Node From End of List

Given a linked list, remove the nth node from the end of list and return its head. For example, ...

[C++]LeetCode 19: Remove Nth Node From End of List(删除链表中倒数第n个节点)

Problem: Given a linked list, remove the nth node from the end of list and return its head. For exam...

Leetcode_19_Remove Nth Node From End of List

本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/41778305 Given a linked list, ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:(Java)LeetCode-19. Remove Nth Node From End of List
举报原因:
原因补充:

(最多只允许输入30个字)