【leetcode】【单链表】【92】Reverse Linked List II
2015-05-10 10:22
323 查看
#include<iostream> using namespace std; struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; class Solution { public: ListNode* reverseBetween(ListNode* head, int m, int n) { if (m == n) return head; ListNode* first = head; ListNode* preFirst = head; ListNode* last = head; ListNode* cur = head; while (--m > 0){ preFirst = first; first = first->next; } while (n-- > 0) last = last->next;//调整区域是前闭后开区间 if (first == preFirst){ //头结点就要调整 cur = first->next; first->next = last; while (cur != last){ ListNode* temp = cur; cur = cur->next; temp->next = head; head = temp; } }else{ //头结点不需调整 preFirst->next = last; cur = first->next; ListNode* newHead = first; while (cur != last){ ListNode* temp = cur; cur = cur->next; temp->next = newHead; newHead = temp; } first->next = preFirst->next; preFirst->next = newHead; } return head; } ListNode* createList(ListNode* head){ int numOfNode; int value; cout << "please input number of listNode:"; cin >> numOfNode; cin >> value; head = new ListNode(value); ListNode* cur = head; for (int i = 1; i < numOfNode; ++i){ cin >> value; ListNode* temp = new ListNode(value); cur->next = temp; cur = temp; } return head; } void printNode(ListNode* head){ ListNode* cur = head; while (cur){ cout << cur->val << " "; cur = cur->next; } cout << endl; } }; int main(){ ListNode* head = NULL; Solution solution; head = solution.createList(head); solution.printNode(head); head = solution.reverseBetween(head, 1, 2); solution.printNode(head); system("pause"); return 0; }
相关文章推荐
- leetcode206/92---Reverse Linked List I/II(反转链表)
- 链表-leetcode 92 Reverse Linked List II
- [LeetCode-92] Reverse Linked List II(反转指定区间链表)
- LeetCode-92-Reverse Linked List II 链表反转 各种边界条件
- leetcode(92) Reverse Linked List II
- leetcode[92] Reverse Linked List II
- LeetCode 92 Reverse Linked List II
- [leetcode] 【链表】92. Reverse Linked List II
- leetcode——92——Reverse Linked List II
- Leetcode Reverse Linked List II 反转部分单向链表
- leetcode:单链表之Reverse Linked List II
- LeetCode 92: Reverse Linked List II
- LeetCode2.2.2 @ Reverse Linked List II 反转链表II D3F2
- [LeetCode] Reverse Linked List I II - 链表翻转问题
- [leetcode 92] Reverse Linked List II
- LeetCode(92) Reverse Linked List II
- leetcode 92 Reverse Linked List II C++
- Leetcode 92. Reverse Linked List II 翻转链表2 解题报告
- leetcode92 Reverse Linked List II
- Leetcode#92 Reverse Linked List II