【leetcode】【单链表】【143】Reorder List
来源:互联网 发布:天津网络危机公关公司 编辑:程序博客网 时间:2024/05/16 07:58
#include<iostream>using namespace std;struct ListNode {int val;ListNode *next;ListNode(int x) : val(x), next(NULL) {}};class Solution {public://翻转链表ListNode* reverseList(ListNode* head) {ListNode* cur = head;ListNode* new_head = NULL;while (cur){ListNode* temp = cur;cur = cur->next;temp->next = new_head;new_head = temp;}head = new_head;return head;}void reorderList(ListNode* head) {if (head == NULL || head->next == NULL)return;ListNode* slow = head;ListNode* fast = head;ListNode* last = head;//得到list的中点while (fast&&fast->next){last = slow;slow = slow->next;fast = fast->next->next;}last->next = NULL;last = NULL;//后半段反转slow=reverseList(slow);fast = head;ListNode* temp = NULL;while (fast){temp = slow;slow = slow->next;temp->next = fast->next;fast->next = temp;last = fast->next;fast = fast->next->next;}if (slow)last->next = slow;}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 lst;head = lst.createList(head);lst.printNode(head);lst.reorderList(head);lst.printNode(head);system("pause");return 0;}
0 0
- 【leetcode】【单链表】【143】Reorder List
- LeetCode(143)Reorder List
- LeetCode 143 Reorder List
- LeetCode: Reorder List [143]
- [leetcode 143] Reorder List
- [LeetCode 143]Reorder List
- leetcode || 143、Reorder List
- [leetcode] #143 Reorder List
- Reorder List - LeetCode 143
- Leetcode[143]-Reorder List
- leetcode[143]:Reorder List
- LeetCode 143: Reorder List
- LeetCode(143) Reorder List
- [Leetcode]#143 Reorder List
- 143 Reorder List [Leetcode]
- (Leetcode 143 )Reorder List
- leetcode-Reorder List-143
- Leetcode Reorder List 143
- Cocos2d-x 屏幕适配
- 病毒分析师初探-转载
- 【leetcode】Longest Common Prefix
- Nvidia Maxwell Architecture
- openOCD的使用1: 应用openOCD和Jlink仿真器连接Freescale K60系列 MCU
- 【leetcode】【单链表】【143】Reorder List
- android渠道包自动化验证
- hdu 2030 汉字统计 (java)
- 机房收费系统 Section One
- 牛腩新闻发布系统-零碎拾起
- Java第二次作业
- Java: Passing Array To Oracle Stored Procedure
- 手把手教你cuda5.5与VS2010的编译环境搭建
- Leetcode: Add and Search Word - Data structure design (Java)