class Solution {
public int[] sortArray(int[] nums) {
return sort(nums,0,nums.length-1);
}
int[] sort(int[] nums, int low, int high){
if(low >= high) return nums;//递归终止条件
//分开 成两个数组[low,mid] [mid+1,high]
int mid = low + (high-low) / 2;
sort(nums, low, mid);
sort(nums, mid+1, high);
//合并 这两个数组[low,mid] [mid+1,high]
merge(nums,low,mid,high);
return nums;
}
//分治 合并两个数组[low,mid] [mid+1,high]为一个升序数组temp
void merge(int[] nums,int low, int mid, int high){
//1 合并两个数组[low,mid] [mid+1,high]为一个升序数组temp
int[] temp = new int[high - low + 1];//本次排序后的升序的临时数组
int index = 0;//用于填充临时数组
int i = low;
int j = mid+1;
while(i <= mid && j <= high){
if(nums[i] < nums[j])
temp[index++] = nums[i++];//升序填充temp
else
temp[index++] = nums[j++];
}
while(i <= mid) temp[index++] = nums[i++];//把数组[low,mid]未排序的数原样移入temp数组
while(j <= high) temp[index++] = nums[j++];//把数组[mid+1,high]未排序的数原样移入temp数组
//2 用temp覆盖nums的[low,high]段
for(int k = 0; k < temp.length; k++) nums[low + k] = temp[k];
}
}
合并方法 merge()的示意图:
归并排序的应用题:912. 排序数组