LeetCode 912：排序数组（快速排序、归并排序和堆排序）

快速排序

class Solution:
    def sortArray(self, nums: List[int]) -> List[int]:
        def quickSort(l,r):
            if l>=r:
                return
            import random
            pivot = random.randint(l, r)
            nums[l], nums[pivot] = nums[pivot], nums[l]
            pivot,i,j=nums[l],l,r
            while i<j:
            	#先后->前，再前->后
                while i<j and nums[j]>=pivot:
                    j-=1
                while i<j and nums[i]<=pivot:
                    i+=1
                nums[i],nums[j]=nums[j],nums[i]
            nums[l],nums[i]=nums[i],nums[l]
            quickSort(l,i-1)
            quickSort(i+1,r)
        quickSort(0,len(nums)-1)
        return nums

归并排序

class Solution:
    def sortArray(self, nums: List[int]) -> List[int]:
        def mergeSort(l, r):
	        if l >= r:
	            return
	        mid = (l + r) // 2
	        mergeSort(0, mid)
	        mergeSort(mid + 1, r)
	        merge(l, mid, r)

    def merge(l, mid, r):
        p, q = l, mid + 1
        temp = []
        while p <= mid and q <= r:
            if nums[p] < nums[q]:
                temp.append(nums[p])
                p += 1
            else:
                temp.append(nums[q])
                q += 1
        if p <= mid:
            temp += nums[p:mid + 1]
        else:
            temp += nums[q:r + 1]
        nums[l:r + 1] = temp

    mergeSort(0, len(nums) - 1)
    return nums

堆排序

class Solution:
    def sortArray(self, nums: List[int]) -> List[int]:
        n=len(nums)
        def adjustHeap(n,i):
            large=i
            l,r=2*i+1,2*i+2
            if l<n and nums[l]>nums[large]:
                large=l
            if r<n and nums[r]>nums[large]:
                large=r
            if large!=i:
                nums[large],nums[i]=nums[i],nums[large]
                adjustHeap(n,large)
        for i in range(n//2,-1,-1):
            adjustHeap(n,i)
        for i in range(n-1,-1,-1):
            nums[i],nums[0]=nums[0],nums[i]
            adjustHeap(i,0)#每次固定最后一个位置
        return nums