Leecode Week11: Remove Nth Node From End of List

Week11: Remove Nth Node From End of List

Difficulty:Medium

1.Problem

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.

2.Algorithm

1.首先判断是否只有一个元素，若是只有一个元素则返回NULL。因为输入的n肯定是合理的。

2.然后创建一个指针变量start，start->next=head。其中head是输入链表的头部。这样做是为了保证“输入的n刚好是要去掉头部”的情况不会发生错误。

3.接下来，是要创建两个指针指向start，一个为fast，另一个为slow。其中fast指针会slow指针快n步，这样fast到达链表尾部时，slow刚好到达需要去掉的元素的上一个位置。

4.这样slow->next = slow->next->next便可以去掉需要去掉的元素

5.返回start->next

3.Solution

/**
 * 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->next == NULL) {
            return NULL;
        }
        //为了解决输入（【1，2】，2）
        ListNode *start = new ListNode(0);
        start->next = head;

        int count = 0;
        ListNode *fast = start;
        ListNode *slow = start;
        while(fast->next != NULL) {
            fast = fast->next;
            if(count < n) {
                count++;
            }
            else{
                slow = slow->next;
            }
        }
        slow->next = slow->next->next;
        return start->next;
    }
};