【LeetCode】Remove Nth Node From End of List

Remove Nth Node From End of List

  Total Accepted: 17965  Total Submissions: 60372 My Submissions

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.

/**
 * 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 == NULL) return head;
        if (n < 1)  return head;
        ListNode *p = head;
        int len = 0;
        while (p) {
            len++;
            p = p->next;
        }
        if (len < n) return head;
        int k = len - n;
        if (k == 0) {
            p = head;
            head = head->next;
            delete(p);
            return head;
        }
        p = head;
        while (k > 1) {
            p = p->next;
            k--;
        }
        ListNode *q = p->next;
        p->next = q->next;/脑子要清醒呀！！！！第一遍写成了NULL
        delete(q);
        return head;
    }
};