import java.util.*; public class Solution { // 思路:归并排序的思想,分治之后排序合并 public int mod = 1000000007; public int mergeSort(int left, int right, int[] nums, int[] temp) { if (left >= right) { return 0; } int mid = (left + right) / 2; // 递归分治,左右划分合并 int res = mergeSort(left, mid, nums, temp) + mergeSort(...