本文共 2714 字，大约阅读时间需要 9 分钟。

单链表快速排序

class ListNode():    def __init__(self,val):        self.val = val        self.next = Noneclass Solution():    def mergesortoflist(self,node):        if not node or not node.next:            return node        midnode = node        left = ListNode(0)        resL = left        right = ListNode(0)        resR = right        node = node.next        while node:            if midnode.val < node.val:                right.next = node                right = right.next            else:                left.next = node                left = left.next            node = node.next        left.next = None        right.next = None        L = self.mergesortoflist(resL.next)        R = self.mergesortoflist(resR.next)        midnode.next = R        if not L:            return midnode        else:            temp = L            while temp.next:                temp = temp.next            temp.next = midnode        return L a = [2,5,3,8,7,0,1,5,4,6,1]nh = ListNode(0)n = nhfor tmp in a:    tmpn = ListNode(tmp)    n.next = tmpn    n = tmpnnh = nh.nextquicksort = Solution()nhsort = quicksort.mergesortoflist(nh)asort = []tmpn = nhsortwhile tmpn is not None:    asort.append(tmpn.val)    tmpn = tmpn.nextprint(a)print(asort)# --------------------------------------------输出---------------------------------------[2, 5, 3, 8, 7, 0, 1, 5, 4, 6, 1][0, 1, 1, 2, 3, 4, 5, 5, 6, 7, 8]

数组快速排序

def quickSorst(array):    if len(array) < 2:        return array    else:        pivot = array[0]        less = [i for i in array[1:] if i <= pivot]        greater = [i for i in array[1:] if i > pivot]        return quickSorst(less) + [pivot] + quickSorst(greater)a = quickSorst([2, 5, 3, 8, 7, 0, 1, 5, 4, 6, 1])print(a)# --------------------------------------------输出---------------------------------------[0, 1, 1, 2, 3, 4, 5, 5, 6, 7, 8]

并查集

class UnionFind:    def __init__(self):        """        记录每个节点的父节点        """        self.father = {
   }        def find(self,x):        """        查找根节点        路径压缩        """        root = x        while self.father[root] != None:            root = self.father[root]        # 路径压缩        while x != root:            original_father = self.father[x]            self.father[x] = root            x = original_father                 return root        def merge(self,x,y,val):        """        合并两个节点        """        root_x,root_y = self.find(x),self.find(y)                if root_x != root_y:            self.father[root_x] = root_y    def is_connected(self,x,y):        """        判断两节点是否相连        """        return self.find(x) == self.find(y)        def add(self,x):        """        添加新节点        """        if x not in self.father:            self.father[x] = None

例题：

转载地址：https://blog.csdn.net/wqwqqwqw1231/article/details/116486174 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！