leetcode 快排

class Solution {
    public int[] sortArray(int[] nums) {

        int n = nums.length;
        quickSort(nums,0,n-1);
        
        return nums;
    }

    public void quickSort(int[] nums, int left , int right){
        if(right<=left){
            return ;
        }
        int l = left;
        int r = right;
        int tmp = nums[l];
        while(l<r){
            //从右边
            while(l<r && nums[r]>=tmp){
                r--;
            }
            if(l<r){
                nums[l] = nums[r];
            }

            //从左边
            while(l<r && nums[l]<tmp){
                l++;
            }
            if(l<r){
                nums[r] = nums[l];
            }
            nums[l] = tmp;
        }
        quickSort(nums,left,l-1);
        quickSort(nums,l+1,right);
    }
}