LeetCode 19. 删除链表的倒数第N个节点
原题链接
中等
作者:
linux_2019
,
2019-07-29 09:37:11
,
所有人可见
,
阅读 989
C++ 代码
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
int dfs(ListNode * head,int n)
{
if(!head) return 0;
int tmp=dfs(head->next,n);
if(tmp==n)
{
ListNode * next=head->next;
head->next=head->next->next;
delete next;
}
return tmp+1;
}
ListNode* removeNthFromEnd(ListNode* head, int n) {
int tmp=dfs(head,n);
if(tmp==n)
{
ListNode * next=head->next;
delete head;
return next;
}
return head;
}
};