LeetCode-remove-nth-node-from-end-of-list

原创 2016年08月30日 20:54:50

题目描述


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个,得到正数第m个。

效果太差!这种需要两次遍历的题目,统统采用两个指针的方法,先让一个指针走n步,然后同时走,最后先走的指针到达末尾的时候,后走的指针停下来的位置就是我们寻找的位置!6不6!

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode fast = head;
    	ListNode slow = head;
    	ListNode flag = new ListNode(0);
    	ListNode pre = flag; 
    	pre.next = slow;
    	for(int i=1; i<n; i++){
    		fast = fast.next;
    	}
    	while(fast.next != null) {
    		fast = fast.next;
    		slow = slow.next;
    		pre = pre.next;
    	}
    	pre.next = slow.next;
    	return flag.next;
    }
}

我们这里用了三个指针,即加了一个pre指针,其实本题可以不用一个指针指向待删除的结点,而只要找到待删除结点的前一结点,然后pre.next = pre.next.next即可。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        
    	ListNode pre = new ListNode(0);
    	pre.next = head;
        
        ListNode predelete = pre;
    	for(int i=0; i<n; i++){
            if(head==null){
                return null;
            }
    		head = head.next;
    	}
    	while(head != null) {
    		head = head.next;
    		predelete = predelete.next;
    	}
    	predelete.next = predelete.next.next;
    	return pre.next;
    }
}

我感觉还是用三个指针更加清晰!

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

LeetCode 第十九题 Remove Nth Node From End of List

一,问题描述 1,删除一个单链表末尾开始算起的第n个结点,然后返回该单链表。 2,例如: 输入: 1->2->3->4->5 其中n=2; 输出: 1->2->3->5; 3,解题思...

Remove Nth node from End of list--LeetCode

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

【LeetCode】Remove Nth Node From End of List

题目介绍: 下面给出两种算法: 算法一

[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
  • 127

LeetCode#19. Remove Nth Node From End of List

题目:删除链表倒数第n个元素

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,Given ...

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

19. Remove Nth Node From End of ListGiven a linked list, remove the nth node from the end of list an...

LeetCode: 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, ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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