Leetcode19

Remove Nth Node From End of List:
Given a linked list, remove the n-th node from the end of list and return its head.
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.

Solution:

#include <iostream>

using namespace std;

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {

        ListNode* dummyNode = new ListNode(0);
        dummyNode->next = head;

        ListNode* p = dummyNode;
        ListNode* q = dummyNode;

        for ( int i = 0; i < n+1; i++){
            q = q->next;
        }

        while ( q != NULL ){
            p = p->next;
            q = q->next;
        }

        ListNode* delNode = p->next;
        p->next = delNode->next;
        delete delNode;

        ListNode* retNode = dummyNode->next;
        delete dummyNode;

        return retNode;

    }
};

总结： 从给出的例子可以看出n是从1开始的。上述解法只遍历了一次链表，用了中间间隔不变的思路，设置两个指针，很是巧妙一定学会！这道题还有一种普通的思路：遍历两次链表，第一次遍历知道链表的长度L，利用L-n得到要删除结点的前一个结点，第二次遍历使指针指向要删除结点的前一个结点，然后删除结点就好了。