在一个数组中, 每一个数左边比当前数小的数累加起来, 叫做这个数组的小和。 求一个数组
的小和。
例子:
[1,3,4,2,5]
1左边比1小的数, 没有;
3左边比3小的数, 1;
4左边比4小的数, 1、 3;
2左边比2小的数, 1;
5左边比5小的数, 1、 3、 4、 2;
所以小和为1+1+3+1+1+3+4+2=16
解题思路
import java.util.Arrays;
public class Code_littleSum {
// Solution 1 T:O(N^2) S:O(1)
public static int littleSum_1(int[] arr) {
if (arr == null)
return 0;
int sum = 0;
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < i; j++) {
if (arr[j] < arr[i]) {
sum += arr[j];
}
}
}
return sum;
}
// Solution 2 T:O(N*logN) S:O(N)
public static int littleSum_2(int[] arr) {
if (arr == null || arr.length < 2)
return 0;
return mergeSort(arr, 0, arr.length - 1);
}
public static int mergeSort(int[] arr, int L, int R) {
if (L == R) {
return 0;
}
int mid = L + (R - L) / 2;
return mergeSort(arr, L, mid) + mergeSort(arr, mid + 1, R) + merge(arr, L, mid, R);
}
public static int merge(int[] arr, int L, int mid, int R) {
int[] help = new int[R - L + 1];
int i = 0;
int p1 = L;
int p2 = mid + 1;
int sum = 0;
while (p1 <= mid && p2 <= R) {
sum += arr[p1] < arr[p2] ? arr[p1] * (R - p2 + 1) : 0;
help[i++] = arr[p1] < arr[p2] ? arr[p1++] : arr[p2++];
}
while (p1 <= mid) {
help[i++] = arr[p1++];
}
while (p2 <= R) {
help[i++] = arr[p2++];
}
return sum;
}
// Tool function
public static void printArray(int[] arr) {
if (arr == null)
return;
for (int i = 0; i < arr.length - 1; i++) {
System.out.print(arr[i] + " ");
}
System.out.println("");
}
public static int[] copyArray(int[] arr) {
if (arr == null)
return null;
int[] result = new int[arr.length];
for (int i = 0; i < arr.length; i++) {
result[i] = arr[i];
}
return result;
}
public static int[] generateRandomArray(int size, int value) {
int[] arr = new int[(int) ((size + 1) * (Math.random()))];
for (int i = 0; i < arr.length; i++) {
arr[i] = (int) ((value + 1) * Math.random()) - (int) (value * Math.random());
}
return arr;
}
public static void rightMethod(int[] arr) {
Arrays.sort(arr);
}
public static boolean isEqual(int[] arr1, int[] arr2) {
if ((arr1 == null && arr2 != null) || (arr1 != null && arr2 == null)) {
return false;
}
if (arr1 == null && arr2 == null) {
return true;
}
if (arr1.length != arr2.length) {
return false;
}
for (int i = 0; i < arr1.length; i++) {
if (arr1[i] != arr2[i]) {
return false;
}
}
return true;
}
public static void main(String[] args) {
int testTime = 50000;
int size = 100;
int value = 100;
boolean succeed = true;
for (int i = 0; i < testTime; i++) {
int[] arr1 = generateRandomArray(size, value);
int[] arr2 = copyArray(arr1);
int[] arr3 = copyArray(arr1);
littleSum_1(arr1);
littleSum_2(arr2);
if (!isEqual(arr1, arr2)) {
succeed = false;
printArray(arr3);
break;
}
}
System.out.println(succeed ? "All Case Passed!" : "Case Wrong!");
}
}