leetCode(9):Remove Nth Node From End of List
2015-06-18 08:15
519 查看
Given a linked list, remove the nth node from the end of list and return its head.
For example,
Note:
Given n will always be valid.
Try to do this in one pass.
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.
/** * 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) { if(!head) return NULL; ListNode* fast=head; ListNode* slow=head; int i=0; while(i<n+1 && fast) { i++; fast=fast->next; } if(!fast && i==n) { ListNode* toBeDeleted=head; ListNode* newHead=toBeDeleted->next; delete toBeDeleted; toBeDeleted=NULL; return newHead; } if(!fast && i<n+1) return head; while(fast) { slow=slow->next; fast=fast->next; } ListNode* toBeDeleted=slow->next; slow->next=toBeDeleted->next; delete toBeDeleted; toBeDeleted=NULL; return head; } };
相关文章推荐
- leetCode(9):Remove Nth Node From End of List 分类: leetCode 2015-06-18 08:15 109人阅读 评论(0) 收藏
- nodejs npm常用命令
- [Node.js] Node.js Buffers
- node 在服务器端启动
- Node.js事件驱动
- 浅谈Node.js中的定时器
- hadoop启动后jps没有namenode
- 完全卸载node.js
- hadoop启动datanode的一个异常处理
- Nodejs最佳实践
- Joyent---Nodejs生产实践----(1)Design
- 极速Node.js:来自LinkedIn的10个性能提升秘籍
- 让NodeJs更快的10个技巧
- Node环境下实现less编译
- 生产环境部署NodeJs最佳实践
- NodeJS初识
- 查看Nodejs 占用的端口
- NodeJs框架对比:Express、Koa、Hapi
- Reverse Nodes in k-Group
- Node.Js - 路由Router