LeetCode 19. Remove Nth Node From End of List 解题报告

19. Remove Nth Node From End of List

My Submissions

Question

Total Accepted: 94847  Total Submissions: 330667  Difficulty: Easy

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.

Subscribe to see which companies asked this question

Show Tags

Have you met this question in a real interview? 

Yes

 

No

Discuss

    这道题标的是Easy级别，但是个人觉得这道题对指针操作的要求一点都不easy。考虑一个边界条件，n是链表的长度。构建一个仅作为标志作用的头指针，这个指针指向实际的head指针。

    我的AC代码

public class RemoveNthNodeFromEndofList {

	public ListNode removeNthFromEnd(ListNode head, int n) {
		if(n == 0) return head;
		
		ListNode p1 = head, p2 = head;
		ListNode h = new ListNode(0);
		h.next = head;	//仅作为标志作用的头指针
		ListNode pre = h;
		
		for (int i = 0; i < n; i++) {
			p2 = p2.next;
		}
		
		while(p2 !=null) {
			pre = p1;
			p1 = p1.next;
			p2 = p2.next;
		}
		
		pre.next = p1.next;  // remove
		
		return h.next;
	}
}