链表-删除链表中倒数第n个节点-简单

描述
给定一个链表，删除链表中倒数第n个节点，返回链表的头节点。
链表中的节点个数大于等于n
您在真实的面试中是否遇到过这个题？  
样例
给出链表1->2->3->4->5->null和 n = 2.
删除倒数第二个节点之后，这个链表将变成1->2->3->5->null.
挑战

O(n)时间复杂度

题目链接

程序

/**
 * Definition of singly-linked-list:
 * class ListNode {
 * public:
 *     int val;
 *     ListNode *next;
 *     ListNode(int val) {
 *        this->val = val;
 *        this->next = NULL;
 *     }
 * }
 */

class Solution {
public:
    /**
     * @param head: The first node of linked list.
     * @param n: An integer
     * @return: The head of linked list.
     */
    ListNode * removeNthFromEnd(ListNode * head, int n) {
        // write your code here
        if(head == NULL)    return head;
        int len = 0;
        for(ListNode *node = head; node != NULL; node = node->next)
            len++;
        if(len == n){//如果删除的为头结点
            return head->next;//直接返回头结点后面的链表
        }
        ListNode *fast = head;
        for(int i = 0; i <= n; i++)
            fast = fast->next;
        ListNode *slow = head;
        while(fast != NULL){//通过快慢指针找到倒数的节点
            fast = fast->next;
            slow = slow->next;
        }
        ListNode *tmp = slow->next;
        slow->next = slow->next->next;
        delete tmp;
        return head;
    }
};