leetcode912. 排序数组(java & python3)【快排】

y总年轻好帅子 模版真好用子 呜呜呜 ❤️

java：

class Solution {
    public int[] sortArray(int[] nums) {
        quciksort(nums, 0, nums.length - 1);
        return nums;
    }
    public static void quciksort(int[] q, int l, int r){
        if(l >= r) return;
        int x = q[l + r >> 1];

        int i = l - 1;
        int j = r + 1;

        while(i < j){
            do i++; while (q[i] < x);
            do j--; while (q[j] > x);
            if(i < j){
                int tmp = q[i];
                q[i] = q[j];
                q[j] = tmp;
            }
        }

        quciksort(q, l, j);
        quciksort(q, j + 1, r);
    }
}

python3：

class Solution:
    def sortArray(self, nums: List[int]) -> List[int]:
        def quicksort(nums,left,right):
            flag=nums[(left+right)//2]              
            i,j=left,right                         
            while i<=j:
                while nums[i]<flag: i+=1         
                while nums[j]>flag: j-=1           
                if i<=j:
                    nums[i],nums[j]=nums[j],nums[i] 
                    i+=1                            
                    j-=1                            
            if i<right: quicksort(nums,i,right)  
            if j>left:  quicksort(nums,left,j)      
        quicksort(nums,0,len(nums)-1)              
        return nums