[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.

思路

因为题目中要求在one pass中解决，首先找到距离头结点长度为n的节点作为尾结点，然后头结点和尾结点同时向前遍历，直到尾结点到达原链表的尾部，去除此时头结点后的那个结点即为所求。需要注意的是边界情况的处理。

代码

/**
 * 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 begin = head;
        ListNode end = head;
        
        for(int i = 0; i < n; i++) {
            end = end.next;
        }
        
        if(end == null) {
          begin = begin.next;
          head = null;
          return begin;
        }
        
        while(end.next != null) {  
            begin = begin.next;  
            end = end.next;  
        }
        
        ListNode tmp = begin.next.next;  
        begin.next = tmp;  
        return head;  
    }
}