题目:
数组小和的定义:例如,数组s=[1,3,5,2,4,6],在s[0]的左边小于等于s[0]的数的和为0,在s[1]的左边小于或等于s[1]的数和为1,在s[2]的左边小于等于s[2]的数和为1+3=4..一次类推s[3]—1,s[4]—1+3+2=6,s[5]—15,所以s的小和为0+1+4+1+6+15=27,给定一个数组,实现函数返回小和
思路:这个大家都能想到暴力方法吧,就是遍历。我们这里将一个更好的方法,就是改进归并排序,这个比较跟归并排序很像,我们要转变思想把当前数前面比她小的和转变为当前数要被加几次(就是跟后面数做比较,后面数比当前数大,就要加一次),这个正符合归并排序,每次比较,我们需要改进的是在比较是若后面数比当前数大,sum就加当前数,只需加一句:smallSum += s[i] * (right - j+ 1);
package problems_2017_07_26;
public class Problem_02_SmallSum {
public static int getSmallSum(int[] arr) {
if (arr == null || arr.length == 0) {
return 0;
}
return func(arr, 0, arr.length - 1);
}
public static int func(int[] s, int l, int r) {
if (l == r) {
return 0;
}
int mid = (l + r) / 2;
return func(s, l, mid) + func(s, mid + 1, r) + merge(s, l, mid, r);
}
public static int merge(int[] s, int left, int mid, int right) {
int[] h = new int[right - left + 1];
int hi = 0;
int i = left;
int j = mid + 1;
int smallSum = 0;
while (i <= mid && j <= right) {
if (s[i] <= s[j]) {
smallSum += s[i] * (right - j + 1);
h[hi++] = s[i++];
} else {
h[hi++] = s[j++];
}
}
for (; (j < right + 1) || (i < mid + 1); j++, i++) {
h[hi++] = i > mid ? s[j] : s[i];
}
for (int k = 0; k != h.length; k++) {
s[left++] = h[k];
}
return smallSum;
}
public static void swap(int[] arr, int index1, int index2) {
int tmp = arr[index1];
arr[index1] = arr[index2];
arr[index2] = tmp;
}
public static void main(String[] args) {
int[] arr = { 3, 1, 2, 4, 6, 2, 7, 8, 1 };
System.out.println(getSmallSum(arr));
}
}