leetcode[19]:Remove Nth Node From End of List Total

Remove Nth Node From End of List

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.

/** * Definition for singly-linked list. * struct ListNode { *     int val; *     struct ListNode *next; * }; */struct ListNode* removeNthFromEnd(struct ListNode* head, int n) {    int i,l;    struct ListNode *L, *tmp;    L=head;    tmp = (struct ListNode* ) malloc( sizeof(struct ListNode* ) );    for(l=0;L!=NULL;l++)    {        L=L->next;    }    if(l==n) return head->next;    L=head;    for(i=0;i<l-n-1;i++)    {        L=L->next;    }    tmp=L->next;    L->next=tmp->next;    free(tmp);    return head;}

没有使用双指针，注意头结点！！！！