题目:
思路:
1.第一想法就是用冒泡排序,但是会超出时间限制
2.这道题用快速排序最快
class Solution {
public int[] sortArray(int[] nums) {
quickSort(nums, 0, nums.length - 1);
return nums;
}
public void quickSort(int[] nums, int left, int right){
if (left > right) return;
int tmp = nums[left];
int l = left, r = right;
while (l < r){
while (l < r && nums[r] >= tmp) r--;
while (l < r && nums[l] <= tmp) l++;
if (l < r){
<