LeetCode-912. 排序数组

给你一个整数数组 nums，将该数组升序排列。

示例 1：
输入：nums = [5,2,3,1]
输出：[1,2,3,5]

示例 2：
输入：nums = [5,1,1,2,0,0]
输出：[0,0,1,1,2,5]

提示：

1. 1 <= nums.length <= 50000
2. -50000 <= nums[i] <= 50000

题目连接链接：https://leetcode-cn.com/problems/sort-an-array

方法一：快速排序
思路和算法

class Solution:
    def randomized_partition(self, nums, l, r):
        pivot = random.randint(l, r)
        # pivot与r交换
        nums[pivot], nums[r] = nums[r], nums[pivot]
        # i从数组开头的前一个位置开始
        i = l - 1 
        for j in range(l, r):
            if nums[j] < nums[r]:
                i += 1
                # i和j位置交换（即i先+1，再与j交换）
                nums[i], nums[j] = nums[j], nums[i]

        # 整个数字扫码完之后，i的位置再向后移动一位，
        i += 1
        nums[i], nums[r] = nums[r], nums[i]

        return i 
    
    def randomized_quicksort(self, nums, l, r):
        if r - l <= 0:
            return
        mid = self.randomized_partition(nums, l, r)
        self.randomized_quicksort(nums, l, mid - 1)
        self.randomized_quicksort(nums, mid + 1, r)

    def sortArray(self, nums: List[int]) -> List[int]:
        self.randomized_quicksort(nums, 0, len(nums) - 1)
        
        return nums

复杂度分析

方法二：堆排序
预备知识

1. 堆

思路和算法

class Solution:
    def max_heapify(self, heap, root, heap_len):
        p = root
        while p * 2 + 1 < heap_len:
            l, r = p * 2 + 1, p * 2 + 2
            if heap_len <= r or heap[r] < heap[l]:
                nex = l
            else:
                nex = r
            if heap[p] < heap[nex]:
                heap[p], heap[nex] = heap[nex], heap[p]
                p = nex
            else:
                break
        
    def build_heap(self, heap):
        for i in range(len(heap) - 1, -1, -1):
            self.max_heapify(heap, i, len(heap))

    def heap_sort(self, nums):
        self.build_heap(nums)
        for i in range(len(nums) - 1, -1, -1):
            nums[i], nums[0] = nums[0], nums[i]
            self.max_heapify(nums, 0, i)
            
    def sortArray(self, nums: List[int]) -> List[int]:
        self.heap_sort(nums)
        return nums

复杂度分析