leetcode-题库-算法-19. 删除链表的倒数第N个节点

class Solution {
	public ListNode removeNthFromEnd(ListNode head, int n) {
		int len = 0;
		ListNode cur = head;
		while (cur != null) {
			cur = cur.next;
			++len;
		}
		if (n == len)
			return head.next;
		cur = head;
		for (int i = 0; i < len - n - 1; ++i) {
			cur = cur.next;
		}
		cur.next = cur.next.next;
		return head;
	}
}

典型的利用双指针法解题。首先让指针first指向头节点，然后让其向后移动n步，接着让指针sec指向头结点，并和first一起向后移动。当first的next指针为NULL时，sec即指向了要删除节点的前一个节点，接着让first指向的next指针指向要删除节点的下一个节点即可。注意如果要删除的节点是首节点，那么first向后移动结束时会为NULL，这样加一个判断其是否为NULL的条件，若为NULL则返回头结点的next指针。
class Solution {
	public ListNode removeNthFromEnd(ListNode head, int n) {
		ListNode fir = head, sec = head;
		for (int i = 0; i < n; ++i)
			fir = fir.next;
		if(fir==null)
			return head.next;
		while (fir.next != null) {
			fir = fir.next;
			sec = sec.next;
		}
		sec.next = sec.next.next;
		return head;
	}
}