链表-Leetcode

19. Remove Nth Node From End of List

问题：移除链表的倒数第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) {
        if (!head) return head;
        ListNode* dummy= new ListNode(0);
        dummy->next = head;
        ListNode* fast = dummy;
        ListNode* slow = dummy;
        for(int i = 1; i <= (n+1); ++i)//走n+1步的意义
        {
            fast = fast->next;
        }
        while(fast)
        {
            slow = slow->next;
            fast = fast->next;
        }
        slow->next = slow->next->next;// the one after the slow need to be removed
        return dummy->next;
    }
};

简化版：注意走n步，对应的是第n+1个结点。注意最后走到的是最后一个结点还是空结点。

/**
 * 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) {
        if (!head) return head;
        ListNode* fast = head;
        ListNode* slow = head;
        for(int i = 0; i < n; ++i)//走n步，找到顺序第n+1个指针
        {
            fast = fast->next;
        }
        if (!fast) return head->next;//说明只有n个结点
        while(fast->next)
        {
            slow = slow->next;
            fast = fast->next;
        }
        slow->next = slow->next->next;//移除slow后面的结点
        return head;
    }
};