leetcode:Reverse Linked List II
2015-06-20 16:24
513 查看
Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given
return
Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ length of list.
解答思路:记录[m, n]范围内的结点,然后做一次reverse。
For example:
Given
1->2->3->4->5->NULL, m = 2 and n = 4,
return
1->4->3->2->5->NULL.
Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ length of list.
解答思路:记录[m, n]范围内的结点,然后做一次reverse。
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *reverseBetween(ListNode *head, int m, int n) { vector<ListNode*> range(n - m + 1); ListNode* iter = head; for(int i = 1; i < m; ++i) iter = iter->next; for(int i = m, j = 0; i <= n; ++i, ++j) { range[j] = iter; iter = iter->next; } for(size_t i = 0; i < range.size() / 2; ++i) swap(range[i]->val, range[range.size() - i - 1]->val); return head; } };
相关文章推荐
- 异步回调和同步回调
- 北大OJ_1008题:玛雅历
- 初识JAVA3
- Redis学习手册(Sorted-Sets数据类型)
- Codeforces Round #308 (Div. 2)题解
- 讀後感
- POJ -- 1056 IMMEDIATE DECODABILITY (Trie 树)
- Redis学习手册(Key操作命令)
- 人才招聘网站
- Hadoop集群(第8期)_HDFS初探之旅
- 《Material Design》设计 - 色彩篇 - UI调色板
- 【麦可网】Cocos2d-X跨平台游戏开发学习笔记---第九课: Cocos2D-X引擎框架4
- PHP数组与对象之间用递归转换
- asp.net <%%>&<%#%>&<%=%>&<%@%>&<%$%>用法区别
- 拓扑排序
- Hadoop集群(第7期)_Eclipse开发环境设置
- UVA434 - Matty's Blocks
- Deutsch lernen (05)
- LeetCode之“散列表”:Valid Sudoku
- UVa 11346 Probability