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,

   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;
    }
}

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