小和问题
- 题目:在一个数组中,每一个数左边比当前数小的数累加起来,叫做这个数组的小和。
- 举例:
1 3 4 2 5
小和为:1 + (1 + 3) + 1 + (1 + 3 + 4 + 2) = 16
代码实现
普通的暴力破解为:N + N-1+ N-2 + N-3 + ···+ 1 时间复杂度为:O(N^2)
借助归并排序可以实现时间复杂度为:O(N*logN)
package LeetCode;
/**
* @Description:
* @PackageName: LeetCode
* @ClassName: smallSum
* @Author: Y-peak
* @Date: 2021.08.28 00:08 星期六
*/
public class smallSum {
public static int smallSum(int[] arr){
if(arr == null || arr.length < 2){
return 0;
}
return process(arr, 0 , arr.length-1);
}
public static int process(int[] arr, int L,int R){
if(L == R){
return 0;
}
int mid = L + ((R-L) >> 1);
return process(arr, L, mid)
+ process(arr, mid + 1, R)
+ merge(arr, L, mid, R);
}
public static int merge(int[] arr, int L, int M, int R){
int[] help = new int[R-L+1];
int i = 0;
int p1 = L;
int p2 = M + 1;
int res = 0;
while (p1 <= M && p2 <= R){
res += arr[p1] < arr[p2] ? (R - p2 + 1) * arr[p1] : 0;
help[i++] = arr[p1] < arr[p2] ? arr[p1++] : arr[p2++]; //注意相同的时候,要先拷贝右边的数组.不然不正确.
}
while (p1 <= M){
help[i++] = arr[p1++];
}
while (p2 <= R){
help[i++] = arr[p2++];
}
for(i = 0; i < help.length; i++){
arr[L+i] = help[i];
}
return res;
}
public static void main(String[] args) {
int[] arr = new int[]{1,3,4,2,5};
System.out.println(smallSum(arr));
}
}