zoukankan      html  css  js  c++  java
  • 【leetcode】【单链表】【148】Sort List

    #include<iostream>
    using namespace std;
    
    struct ListNode {
    	int val;
    	ListNode *next;
    	ListNode(int x) : val(x), next(NULL) {}
    };
    
    class Solution {
    public:
    	ListNode* merge(ListNode* l1, ListNode* l2){
    		ListNode* temp = new ListNode(0);
    		ListNode* cur = temp;
    		while (l1&&l2){
    			if (l1->val < l2->val){
    				cur->next = l1;
    				l1 = l1->next;
    			}else{
    				cur->next = l2;
    				l2 = l2->next;
    			}
    			cur = cur->next;
    		}
    		if (l1)
    			cur->next = l1;
    		else
    			cur->next = l2;
    		cur = temp->next;
    		temp->next = NULL;
    
    		delete temp;
    		return cur;
    	}
    	ListNode* mergeSort(ListNode* head){ //归并排序
    		if (head == NULL || head->next == NULL)
    			return head;
    		ListNode* slow = head;
    		ListNode* fast = head;
    		ListNode* preSlow = NULL;
    		while (fast&&fast->next){
    			preSlow = slow;
    			slow = slow->next;
    			fast = fast->next->next;
    		}
    		preSlow->next = NULL;
    		ListNode* lList = mergeSort(head);
    		ListNode* rList = mergeSort(slow);
    		return merge(lList, rList);
    	}
    	ListNode* sortList(ListNode* head) {
    		if (head == NULL || head->next == NULL)
    			return head;
    		return mergeSort(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(){
    	Solution solution;
    
    	ListNode* head = NULL;
    	head = solution.createList(head);
    	solution.printNode(head);
    
    	head = solution.sortList(head);
    	solution.printNode(head);
    	system("pause");
    	return 0;
    }

  • 相关阅读:
    Entity Framework 简介
    MongoDB 简述及安装
    js、sql和python版本的乘法口诀对比
    sql 判断输入的日期是否有重叠
    win10 不能调节屏幕亮度 win10 屏幕亮度调节快捷键不能用
    mysql主从配置常见错误处理
    Linux安装mysql总结
    linux安装mongodb总结
    centos安装redis总结
    ERROR 2002 (HY000): Can't connect to local MySQL server through socket '/var/lib/mysql/mysql.sock' (2)
  • 原文地址:https://www.cnblogs.com/ruan875417/p/4558297.html
Copyright © 2011-2022 走看看