912. 排序数组 (三路快排)

最新推荐文章于 2024-07-24 20:44:05 发布

overdosed_

最新推荐文章于 2024-07-24 20:44:05 发布

阅读量35

点赞数

分类专栏： leetcode 文章标签：算法 leetcode java

本文链接：https://blog.csdn.net/weixin_45904682/article/details/129806493

版权

leetcode 专栏收录该内容

82 篇文章 0 订阅

订阅专栏

class Solution {
    Random random = new Random();
    public int[] sortArray(int[] nums) {
        quicksort(nums,0,nums.length - 1);
        return nums;
    }

    private void quicksort(int[] nums,int left, int right) {
        if(left >= right){
            return;
        }
        int randomIndex = left + random.nextInt(right - left + 1);
        swap(nums,left,randomIndex);
        int lt = left + 1;
        int gt = right;
        int i = left + 1;
        while (i <= gt){
            if(nums[i] < nums[left]){
                swap(nums,lt,i);
                lt++;
                i++;
            }else if(nums[i] == nums[left]){
                i++;
            }else {
                swap(nums,i,gt);
                gt--;
            }
        }
        swap(nums,left,lt - 1);
        quicksort(nums,left,lt - 2);
        quicksort(nums,gt + 1,right);
    }


    private void swap(int[] nums,int index1, int index2){
        int temp = nums[index1];
        nums[index1] = nums[index2];
        nums[index2] = temp;
    }
}