leetcode Remove Nth Node From End of List
2015-12-11 21:05
459 查看
原题链接:https://leetcode.com/problems/remove-nth-node-from-end-of-list/
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.
Description
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.
/** * 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) { tot = 0; if (!head) return head; ListNode *p = head; for (; p; p = p->next) tot++; if (n > tot) return head; p = head; int cur = 1; if (tot == n) { head = head->next; delete p; } else { while (p) { if (cur++ == tot - n) break; p = p->next; } ListNode *ret = p->next; p->next = ret ? ret->next : NULL; delete ret; } return head; } private: int tot; };
相关文章推荐
- node 学习笔记 - Modules 模块加载系统 (1)
- [转]为什么我要用 Node.js? 案例逐一介绍
- LeetCode:Remove Nth Node From End of List
- 安装nodejs时提示Leaving directory
- 创建Node Js应用
- inode
- Node.Js简介与安装
- nodejs模块——fs模块
- Permission denied: user=root, access=EXECUTE, inode="/tmp/hadoop-yarn":grid:supergroup:drwx------
- nodejs模块——Event模块
- LeetCode 222 Count Complete Tree Nodes
- node包管理器npm 学习笔记(5)
- Remove Nth Node From End of List
- Insert Node in a Binary Search Tree
- 简述CCNode和Sprite的渲染过程
- hadoop mkdir: Cannot create directory /usr. Name node is in safe mode.
- nodejs 操作文件(文件夹)
- NodeJS 基本操作
- Nodejs源码解析之module
- nodejs入门