Remove Nth Node From End of List--LeetCode
来源:互联网 发布:python 官网下载msi 编辑:程序博客网 时间:2024/05/26 12:59
1.题目
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.
2.题意
只遍历一次链表,删除链表中倒数第N个元素
3.分析
只允许遍历一次
所以我们不能用一次完整的遍历来统计链表长度
而是遍历到对应位置就应该移除了
可以使用快慢指针
cur先走n步后,prev、cur再一起走
当cur->next为空删掉prev->next即可
时间复杂度为O(链表的长度),空间复杂度为O(1)
两个需要注意的点
1)test中似乎没有给出i < n的测试数据
2)但是注意cur == nullptr时删去首节点
4.代码
class Solution {public: ListNode* removeNthFromEnd(ListNode* head, int n) { if(head == nullptr) return nullptr; int i = 0; ListNode *cur = head; while(i < n && cur != nullptr) { cur = cur->next; ++i; } // if(i < n) // return head; if(cur == nullptr) return head->next; ListNode *prev = head; while(cur->next != nullptr) { cur = cur->next; prev = prev->next; } ListNode *tmp = prev->next; prev->next = prev->next->next; delete tmp; return head; }};
阅读全文
0 0
- LeetCode[Linked List]: Remove Nth Node From End of List
- 19. Remove Nth Node From End of List leetcode list
- [Leetcode]LeetCode 19:Remove Nth Node From End of List
- LeetCode: Remove Nth Node From End of List
- LeetCode: Remove Nth Node From End of List
- [Leetcode] Remove Nth Node From End of List
- LeetCode: Remove Nth Node From End of List
- leetcode 40: Remove Nth Node From End of List
- [LeetCode] Remove Nth Node From End of List
- Leetcode 19 Remove Nth Node From End of List
- [Leetcode] Remove Nth Node From End of List
- [LeetCode]Remove Nth Node From End of List
- LeetCode-Remove Nth Node From End of List
- [LeetCode] Remove Nth Node From End of List
- LeetCode 19: Remove Nth Node From End of List
- LeetCode - Remove Nth Node From End of List
- LeetCode | Remove Nth Node From End of List
- leetcode之Remove Nth Node From End of List
- git4
- 关于stl中transfrom使用时编译错误问题
- IEEE754浮点数的表示方法
- NIo、Bio、aio、 的原理及区别与应用场景
- [Unity优化]减少DrawCall:批处理
- Remove Nth Node From End of List--LeetCode
- float属性导致div相互重叠,相互覆盖
- tomcat启动时卡在“INFO: Deploying web application directory .”的解决方法
- 使用websocket-bench进行socket.io性能测试
- PX4飞控之位置控制(1)整体架构
- 上传多个图片,并存储在session中,并且可以删除
- 常见兼容性问题
- linux堆内存漏洞利用之fastbin
- 给出一个百分制成绩,要求输出成绩等级A,B,C,D,E。90分以上为A,80~89分为B,70~79分为C,60~69分为D,60分以下为E