返回值为int[] 的快排写法

Posted 2022-10-15 王六六同学

import java.util.*;
public class Main
    public int[] solution(int[] array) 
        // 在这⾥写代码
      quickSort(array, 0 , array.length - 1);
      int[] res = new int[array.length];
      for(int i=0;i<res.length;i++)
        res[i] = array[i];
      
      return res;
    
  
    public  void quickSort(int[] nums, int l, int r)
      if(l >= r)
        return;
      
      int i = l, j = r, pivot = nums[l];
      
      while(i < j)
        while(i < j && nums[j] >= pivot) j--;
        while(i < j && nums[i] <= pivot) i++;
        swap(nums,i,j);
      
      swap(nums,i,l);
      quickSort(nums,l,i-1);
      quickSort(nums,i+1, r);
    
    public void swap(int[] nums, int i, int j)
      int tmp = nums[i];
      nums[i] = nums[j];
      nums[j] = tmp;