这题我用快速排序法怎么吃TLE了
干泥娘击败
https://pbs.twimg.com/media/FitwOg0VIAASFdn.png
class Solution {
public int[] sortArray(int[] nums) {
quickSort(nums, 0, nums.length - 1);
return nums;
}
private void quickSort(int[] nums, int start ,int end) {
if (start < end) {
int mid = partition(nums, start, end);
quickSort(nums,mid + 1, end);
quickSort(nums, start, mid - 1);
}
}
private int partition(int[] nums, int start ,int end) {
int i = start - 1;
for (int j = start; j < end; j++) {
if (nums[j] <= nums[end]) {
swap(nums, ++i, j);
}
}
swap(nums, ++i, end);
return i;
}
private void swap(int[] nums, int i, int j) {
int tmp = nums[i];
nums[i] = nums[j];
nums[j] = tmp;
}
}