LeetCode-排序数组-中等

标题：912排序数组-中等

题目

给你一个整数数组 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 <= 5 * 104
• -5 * 104 <= nums[i] <= 5 * 104

代码

快排

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;
    swap(nums, left + (int) Math.random() * (right - left + 1), right);
    int[] pos = partation(nums, left, right);
    quickSort(nums, left, pos[0] - 1);
    quickSort(nums, pos[1] + 1, right);
}
public int[] partation(int[] nums, int left, int right) {
    if (left < right) return new int[] {-1, -1};
    if (left == right) return new int[] {left, right};
    int less = left - 1;
    int more = right;
    int index = left;
    while (index < more) {
        if (nums[index] == nums[right]) {
            index++;
        } else if (nums[index] < nums[right]) {
            swap(nums, index++, ++less);
        } else {
            swap(nums, index, --more);
        }
    }
    swap(nums, less + 1, right);
    return new int[] {less + 1, more};
}

public void swap(int[] nums, int i, int j) {
    int temp = nums[i];
    nums[i] = nums[j];
    nums[j] = temp;
}

归并

public int[] sortArray(int[] nums) {
    // 采用归并排序
    mergeSort(nums, 0, nums.length - 1);
    return nums;
}
public void mergeSort(int[] nums, int left, int right) {
    if (left >= right) return;
    int mid = left + ((right - left) >> 1);
    mergeSort(nums, left, mid);
    mergeSort(nums, mid + 1, right);
    merge(nums, left, mid, right);
}
public void merge(int[] nums, int left, int mid, int right) {
    if (left >= right) return;
    int p1 = left;
    int p2 = mid + 1;
    int i = 0;
    int[] help = new int[right - left + 1];
    while (p1 <= mid && p2 <= right) {
        if (nums[p1] <= nums[p2]) {
            help[i++] = nums[p1++];
        } else {
            help[i++] = nums[p2++];
        }
    }
    while (p1 <= mid) {
        help[i++] = nums[p1++];
    }
    while (p2 <= right) {
        help[i++] = nums[p2++];
    }
    for (int j = 0; j < help.length; j++) {
        nums[left + j] = help[j];
    }

}