leetcode 之Remove Nth Node From End of List(19)
2016-05-19 14:27
369 查看
ListNode *removeNthFromEnd(ListNode *head, int n) { ListNode dummy{-1, head}; ListNode *p = &dummy, *q = &dummy; for (int i = 0; i < n; i++) // q 先走 n 步 q = q->next; while(q->next) { // 一起走 p = p->next; q = q->next; } ListNode *tmp = p->next; p->next = p->next->next; delete tmp; return dummy.next; }
View Code
相关文章推荐
- heroku快速部署node应用
- nodejs+phantomjs+七牛 实现截屏操作并上传七牛存储
- 关于node.js的安装与删除
- NodeMCU介绍
- Node.js+Express配置入门教程
- Node.js+Express配置入门
- nodejs
- Node.Buffer
- A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list.
- 三步将Node应用部署到Heroku上
- 【NodeJS】运行在服务端的JavaScript
- LeetCode 24. Swap Nodes in Pairs(交换节点)
- LeetCode 19. Remove Nth Node From End of List(删除链表)
- Node.js+Express配置入门教程详解
- nodejs ENOSPC
- hadoop SecondNamenode详解
- 【软件】IDEA web项目里包含node_modules 一直处于make状态
- DOMNodeRemoved事件 删除元素之后触发的事件
- 利用heroku+mongoLab 部署Node 运用
- Node