11. Container With Most Water

19
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.

方法一：

遍历两遍，第一遍找到从前往后的正确位置，第二遍再删除

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        int k = 0;
        int length = 0;
        ListNode *dummy = new ListNode(0);
        dummy->next = head;

        ListNode *pre = dummy;
        while (pre ->next != NULL) {
            length++;
            pre = pre->next;
        }

        int loc = length - n;
        pre = dummy;
        while (k++ < loc) {
            pre = pre->next;
        }
        ListNode *tmp = pre->next;
        pre->next = pre->next->next;
        delete tmp;
        return dummy->next;
    }
};

int main() {
    Solution sol;
    ListNode* head = new ListNode(1);  // 注意这个声明格式，之前忘了尴尬2333
    ListNode* p = head;
    int k = 1;
    while (k++ < 5)
    {
        p->next = new ListNode(k);
        p = p->next;
    }
    head = sol.removeNthFromEnd(head, 2);
    system("pause");
    return 0;
}

方法二：

双指针，看solution

class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        int k = 0;
        int length = 0;
        ListNode *dummy = new ListNode(0);
        dummy->next = head;
        ListNode *first = dummy;
        ListNode *second = dummy;
        for (int i = 0; i < n + 1; i++) {
            first = first->next;
        }
        while (first != NULL) {
            first = first->next;
            second = second->next;
        }
        ListNode *tmp = second->next;
        second->next = second->next->next;
        delete tmp;
        return dummy->next;
    }
};