LeetCode题解: Reverse Linked List II
来源:互联网 发布:日本神户钢铁造假知乎 编辑:程序博客网 时间:2024/05/16 23:53
Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass.
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; }};
- LeetCode题解: Reverse Linked List II
- Reverse Linked List II|leetcode题解
- LeetCode题解:Reverse Linked List II
- LeetCode题解-92-Reverse Linked List II
- leetcode题解-92. Reverse Linked List II
- leetcode题解-92. Reverse Linked List II
- LeetCode 题解(59): Reverse Linked List II
- LeetCode题解——Reverse Linked List II
- LeetCode题解:Reverse Linked List
- LeetCode题解:Reverse Linked List
- LeetCode题解:Reverse Linked List
- LeetCode[Linked List]: Reverse Linked List II
- LeetCode: Reverse Linked List II
- LeetCode: Reverse Linked List II
- [LeetCode] Reverse Linked List II
- [Leetcode] Reverse Linked List II
- [LeetCode]Reverse Linked List II
- Leetcode: Reverse Linked List II
- 潘石屹早年工友:26年后他成了总裁我还在挑砖
- 在Ubuntu12.04启用Eclipse的globalmenu全局菜单
- ListView的listSelector失效
- Oracle的Numer类型与C,C#数据类型对应关系
- ie11怎么降级
- LeetCode题解: Reverse Linked List II
- LeetCode题解:Surrounded Regions
- 美国cs暑期实习面试记录
- Javascript jQuery 快捷键插件 Firefox热键屏蔽
- Django 1.5碎碎念
- 深入浅出图解C#堆与栈 C# Heap(ing) VS Stack(ing) 第三节 栈与堆,值类型与引用类型
- LeetCode题解: Search for a Range
- 错误./hello: error while loading shared libraries: libQtGui.so.4: cannot open shared object file:
- 移植tslib到开发板及部分问题解决