堆排序（从小到大）

最新推荐文章于 2023-01-16 15:18:44 发布

Jensenate

最新推荐文章于 2023-01-16 15:18:44 发布

阅读量734

点赞数

分类专栏：笔记文章标签：算法 leetcode 排序算法

本文链接：https://blog.csdn.net/m0_52363848/article/details/126325301

版权

笔记专栏收录该内容

2 篇文章 0 订阅

订阅专栏

堆排序

class Solution {
    public int[] sortArray(int[] nums) {
        heapSort(nums);
        return nums;

    }
    //构建大顶堆才能从小到大排序，如果是小顶堆，就是从大到小排序了
    public void heapSort(int[] nums) {
        int len = nums.length;
        maxHeap(nums, len);
        for (int i = len-1; i >= 1; --i) {
            int temp = nums[0];
            nums[0] = nums[i];
            nums[i] = temp;
            heapify(nums, i, 0);
        }
    }
    //构建大顶堆
    public void maxHeap(int[] nums, int len) {
        // int len = nums.length;
        int index = ((len-1)-1)/2;
        for (int i = index; i >= 0; --i) {
            heapify(nums, len, i);
        }
    }

    public void heapify (int[] nums, int len, int maxIndex) {
        if (maxIndex >= len) {
            return;
        }
        int leftIndex = maxIndex*2 + 1;
        int rightIndex = maxIndex*2 + 2;
        int currIndex = maxIndex;
        if (leftIndex < len && nums[leftIndex] > nums[maxIndex]) {
            maxIndex = leftIndex;
        }
        if (rightIndex < len && nums[rightIndex] > nums[maxIndex]) {
            maxIndex = rightIndex;
        }
        if (currIndex != maxIndex) {
            int temp = nums[maxIndex];
            nums[maxIndex] = nums[currIndex];
            nums[currIndex] = temp;
            heapify(nums, len, maxIndex);
        }
    }
}