/**
* 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) {
int i = 1;
ListNode *p = head, *pre, *q;
//因为题目已保证n有效 所以不用担心n大于链表长度
//先找到第n个节点
while (p->next != NULL && i < n)
{
++i;
p = p->next;
}
if (i == n)
{
//令q指向第一个节点
q = head;
//当p指向尾的时候 q就指向了倒数第n个节点
while (p->next != NULL)
{
//同步前进
pre = q;
q = q->next;
p = p->next;
}
if(q==head) return head->next;
pre->next = q->next;
return head;
}
return head;
}
};
Leetcode每日一题:19_remove-nth-node-from-end-of-list(删除链表的倒数第N个节点)
最新推荐文章于 2024-09-19 06:01:52 发布