-
Notifications
You must be signed in to change notification settings - Fork 383
Expand file tree
/
Copy pathSort An Array.java
More file actions
39 lines (37 loc) · 1.08 KB
/
Sort An Array.java
File metadata and controls
39 lines (37 loc) · 1.08 KB
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
class Solution {
public int[] sortArray(int[] nums) {
mergeSort(nums, 0, nums.length - 1);
return nums;
}
private void mergeSort(int[] nums, int start, int end) {
if (end - start <= 0) {
return;
}
int mid = start + (end - start) / 2;
mergeSort(nums, start, mid);
mergeSort(nums, mid + 1, end);
merge(nums, start, mid, end);
}
private void merge(int[] nums, int start, int mid, int end) {
int left = start;
int right = mid + 1;
int[] temp = new int[end - start + 1];
int idx = 0;
while (left <= mid && right <= end) {
if (nums[left] < nums[right]) {
temp[idx++] = nums[left++];
} else {
temp[idx++] = nums[right++];
}
}
while (left <= mid) {
temp[idx++] = nums[left++];
}
while (right <= end) {
temp[idx++] = nums[right++];
}
for (int i = start; i <= end; i++) {
nums[i] = temp[i - start];
}
}
}