LeetCode 912. 排序数组

最新推荐文章于 2024-04-26 17:59:22 发布

interstellar-ai

最新推荐文章于 2024-04-26 17:59:22 发布

阅读量78

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法数据结构

本文链接：https://blog.csdn.net/m0_38128647/article/details/125696161

版权

LeetCode 专栏收录该内容

79 篇文章 0 订阅

订阅专栏

排序数组

在这里插入图片描述
快排

class Solution {
public:
    vector<int> sortArray(vector<int>& nums) {
        srand((unsigned)time(NULL));
        randmized_quickSort(nums, 0, nums.size() - 1);
        return nums;
    }
private:
    void randmized_quickSort(vector<int>& nums, int left, int right) {
        if (left < right) {
            int pos = randmized_partition(nums, left, right);
            randmized_quickSort(nums, left, pos - 1);
            randmized_quickSort(nums, pos + 1, right);
        }
    }
    int randmized_partition(vector<int>& nums, int left, int right) {
        int i = rand() % (right - left + 1) + left;
        swap(nums[i], nums[right]);
        return partition(nums, left, right);
    }
    int partition(vector<int>& nums, int left, int right) {
        int index = left - 1;
        for (int i = left; i < right; ++i) {
            if (nums[i] < nums[right]) {
                swap(nums[i], nums[++index]);
            }
        }
        swap(nums[++index], nums[right]);
        return index;
    }
};