给你一个整数数组 nums，请你将该数组升序排列。
示例 1：
输入：nums = [5,2,3,1]
输出：[1,2,3,5]
示例 2：
输入：nums = [5,1,1,2,0,0]
输出：[0,0,1,1,2,5]
提示：
1 <= nums.length <= 50000
-50000 <= nums[i] <= 50000
最后更新于
这有帮助吗？
这有帮助吗？
/**
* @param {number[]} nums
* @return {number[]}
*/
var sortArray = function (nums) {
const counts = Array(50000 * 2 + 1).fill(0);
const res = [];
for (const num of nums) counts[50000 + num] += 1;
for (let i in counts) {
while (counts[i]--) {
res.push(i - 50000);
}
}
return res;
};function swap(nums, a, b) {
const temp = nums[a];
nums[a] = nums[b];
nums[b] = temp;
}
function helper(nums, start, end) {
if (start >= end) return;
const pivotIndex = start + ((end - start) >>> 1);
const pivot = nums[pivotIndex];
let i = start;
let j = end;
while (i <= j) {
while (nums[i] < pivot) i++;
while (nums[j] > pivot) j--;
if (i <= j) {
swap(nums, i, j);
i++;
j--;
}
}
helper(nums, start, j);
helper(nums, i, end);
}
/**
* @param {number[]} nums
* @return {number[]}
*/
var sortArray = function (nums) {
helper(nums, 0, nums.length - 1);
return nums;
};