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.

思路：双指针法。快慢指针，快指针比慢指针先扫描n个后,当快指针扫描结束时，慢指针扫描到倒数第n个，然后删除该节点即可。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode *dummy=new ListNode(-1);
        dummy->next=head;
        ListNode *p,*q;
        p=dummy,q=dummy;
        for(int i=0;i<n;i++)
        {
            q=q->next;
        }
        while(q->next){
            p=p->next;
            q=q->next;
        }
        p->next=p->next->next;
        return dummy->next;
    }
};

类似问题：链表中倒数第k个结点
题目描述：输入一个链表，输出该链表中倒数第k个结点。

/*
struct ListNode {
    int val;
    struct ListNode *next;
    ListNode(int x) :
            val(x), next(NULL) {
    }
};*/
class Solution {
public:
    ListNode* FindKthToTail(ListNode* pListHead, unsigned int k) {
        ListNode *p=pListHead;
        ListNode *q=pListHead;
        if(!pListHead||!k) return NULL;
        for(int i=0;i<k-1;i++){
            if(p->next) p=p->next;
            else return NULL;
        }
        while(p->next){
            p=p->next;
            q=q->next;
        }
        return q;
    }
};