友情支持
如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜
|
|
有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。
公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。 如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。 |
912. Sort an Array
Given an array of integers nums, sort the array in ascending order.
Example 1:
Input: nums = [5,2,3,1]
Output: [1,2,3,5]Example 2:
Input: nums = [5,1,1,2,0,0]
Output: [0,0,1,1,2,5]Constraints:
-
1 ⇐ nums.length ⇐ 50000 -
-50000 ⇐ nums[i] ⇐ 50000
思路分析
归并排序
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/**
* 归并排序
*
* @author D瓜哥 · https://www.diguage.com
* @since 2024-07-06 17:47:27
*/
public int[] sortArray(int[] nums) {
mergeSort(nums, 0, nums.length - 1);
return nums;
}
private void mergeSort(int[] nums, int left, int right) {
if (right == left) {
return;
}
int mid = left + (right - left) / 2;
mergeSort(nums, left, mid);
mergeSort(nums, mid + 1, right);
merge(nums, left, mid, right);
}
private void merge(int[] nums, int left, int mid, int right) {
int[] temp = new int[right - left + 1];
int l = left, r = mid + 1;
int i = 0;
while (l <= mid && r <= right) {
if (nums[l] <= nums[r]) {
temp[i++] = nums[l++];
} else {
temp[i++] = nums[r++];
}
}
while (l <= mid) {
temp[i++] = nums[l++];
}
while (r <= right) {
temp[i++] = nums[r++];
}
for (int j = left; j <= right; j++) {
nums[j] = temp[j - left];
}
}