归并排序相关题目（待编辑）

• 315
• 327
• 493,
  打卡，典型的不能再典型的归并排序实现，类似的逆序对的题目有如下：315（和本题一样）,327,493, 做完这三道相信归并排序的理解会更加深入

1：归并排序

package SortMerge;import java.util.Arrays;public class SortMerge {public static void main(String[] args) {int[] arr = {1, 7, 4, 9, 3, 5, 6, 2};int[] temp = new int[arr.length];mergeSort(arr, 0, arr.length - 1, temp);System.out.println(Arrays.toString(arr));}public static void mergeSort(int[] arr, int left, int right, int[] temp) {if (left < right) {int middle = (left + right) / 2;mergeSort(arr, left, middle, temp);mergeSort(arr, middle + 1, right, temp);merge(arr, left, middle, right, temp);}}public static void merge(int[] arr, int left, int middle, int right, int[] temp) {int i = left, j = middle + 1, res = 0;while (i <= middle && j <= right) {if (arr[i] <= arr[j]) {temp[res++] = arr[i++];} else {temp[res++] = arr[j++];}}while (i <= middle) {temp[res++] = arr[i++];}while (j <= right) {temp[res++] = arr[j++];}res = 0;int tempLeft = left;while (tempLeft <= right) {arr[tempLeft++] = temp[res++];}System.out.println(Arrays.toString(temp));}
}

本文来自互联网用户投稿，文章观点仅代表作者本人，不代表本站立场，不承担相关法律责任。如若转载，请注明出处。 如若内容造成侵权/违法违规/事实不符，请点击【内容举报】进行投诉反馈！