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.

题目描述

给定一个链表，删除倒数第n个元素。返回链表的头节点。

思路

双指针思想，两个指针相隔n-1，当后一个指针的元素没有后继时，就删除前一个指针的元素。这样就删除了倒数第n个元素。

AC代码

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode removeNthFromEnd(ListNode head,int n){
        if(head == null){
            return null;
        }
        ListNode first = head;
        ListNode second = head;
        ListNode previous = null;//引用   第二个引用second的前一个对象

        for(int i = 0; i < n - 1; i++){
            first = first.next;
        }

        while(first.next != null){
            previous = second;
            first = first.next;
            second = second.next;
        }
        //当要删除的是头部的时候
        if(previous == null){
            head = head.next;
        }
        //否则
        else{
            previous.next = second.next;
        }

        return head;
    }
}