[LeetCode]19. 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-1，每次两个指针向后一步，当后面一个指针没有后继了，前面一个指针就是要删除的节点。

法一：

class ListNode {
public:
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};
 
class Solution
{
public:
	ListNode* removeNthFromEnd(ListNode* head, int n)
	{
		ListNode** t1 = &head, *t2 = head;
		for (int i = 1; i < n; ++i)
		{
			t2 = t2->next;
		}
		while (t2->next != NULL)
		{
			t1 = &((*t1)->next);
			t2 = t2->next;
		}
		*t1 = (*t1)->next;//删除原来t1指向的连接，重新建立连接
		return head;
	}
};

法二：

class Solution {
public:
 ListNode *removeNthFromEnd(ListNode *head, int n) {
         
        if (head == NULL)
             return NULL;
             
         ListNode *pPre = NULL;
         ListNode *p = head;
         ListNode *q = head;
         for(int i = 0; i < n - 1; i++)
             q = q->next;
             
         while(q->next)
         {
             pPre = p;
             p = p->next;
             q = q->next;
         }
         
         if (pPre == NULL)
         {
             head = p->next;
             delete p;
         }
         else
         {
             pPre->next = p->next;
             delete p;
         }
         
         return head;
     }
 };

法一和法二对比可知，法二多定义一个ListNode指针，删除节点后注意要释放点。