LeetCode OJ Reverse Linked List II
来源:互联网 发布:淘宝网店在哪里看 编辑:程序博客网 时间:2024/06/16 03:58
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.
class Solution {public: ListNode *reverseBetween(ListNode *head, int m, int n) { int pos_counter = 1; ListNode *temp_move = head; ListNode *temp_1; ListNode *temp_2; while (pos_counter <= n) { if (pos_counter == m) { temp_1 = temp_move; } if (pos_counter == n) { temp_2 = temp_move; } pos_counter++; temp_move = temp_move->next; } int tempInt[n - m + 1]; temp_move = temp_1; int i = 0; while (temp_2->next != temp_move) { tempInt[i++] = temp_move->val; temp_move = temp_move->next; } i--; temp_move = temp_1; while (temp_2->next != temp_move) { temp_move->val = tempInt[i--]; temp_move = temp_move->next; } return head; }};
0 0
- LeetCode OJ:Reverse Linked List II
- LeetCode OJ - Reverse Linked List II
- LeetCode OJ Reverse Linked List II
- leetcode oj java Reverse Linked List II
- LeetCode OJ 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
- [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
- CodeForces - 44B Cola
- C++中数字与字符串之间的转换
- LeetCode OJ Partition List
- java.io中的字符流简单介绍
- ZOJ1003(1)
- LeetCode OJ Reverse Linked List II
- LeetCode OJ Linked List Cycle II
- 每个Java程序员必须知道的5个JVM命令行标志
- LeetCode OJ Linked List Cycle
- leetcode 之Rotate Array
- LeetCode OJ Insertion Sort List
- LeetCode OJ Sort List
- LeetCode OJ Max Points on a Line
- hdu 4463 Outlets(最小生成树)