首页 > 代码库 > [leetcode-19-Remove Nth Node From End of List]
[leetcode-19-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.
Try to do this in one pass.
思路：
用快慢指针的思想，快指针先移动n个结点，然后快慢指针一起移动，直到快指针到达末尾，然后
快指针的下一个即为要删除的结点。
ListNode* removeNthFromEnd(ListNode* head, int n) { if(head == NULL || n<=0)return head; ListNode* dumb = new ListNode(0); dumb->next = head; ListNode* p = dumb; head = dumb; while(p !=NULL && n--) { p = p->next; } while(p !=NULL && p->next != NULL) { p = p->next; head = head->next; } if(head->next != NULL) head->next = head->next->next; return dumb->next; }
[leetcode-19-Remove Nth Node From End of List]
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。