(*leetcode_LinkedList)Remove Nth Node From End of List

Remove Nth Node From End of List

  Total Accepted: 46314  Total Submissions: 166894 My Submissions

Question  Solution 

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(NULL==head)
            return head;
        int len = 0;
        ListNode *tmp = head;
        while(NULL!=tmp){
            len++;
            tmp = tmp->next;
        }
        if(n==len){
            tmp = head->next;
          //  delete(head);
            return tmp;
        }
        ListNode *pre = head;
        for(int i=0;i<len-n-1; i++){
            pre=pre->next;
        }
        ListNode *del = pre->next;
        pre->next = del->next;
        //delete(del);
        return head;
    }
};