import java.util.*; public class Solution { private int count = 0; private final int MOD = 1000000007; public int InversePairs(int[] nums) { if (nums == null || nums.length == 0) { return 0; } mergeSort(nums, 0, nums.length - 1); return coun...