LeetCoder 19. Remove Nth Node From End of List

题意

思路

代码

/**
* 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) {
ListNode *temp = head;
size_t cnt = 0;
while(temp != NULL){
cnt++;
temp = temp->next;
}
cnt = cnt - n + 1;
if(cnt == 1){
return head->next;
}
temp = head;
ListNode *p = temp;
for(size_t i = 0; i < cnt - 1; i++){
p = temp;
temp = temp->next;
}
p->next = temp->next;
return head;
}
};