-
-
Notifications
You must be signed in to change notification settings - Fork 4.5k
/
Copy path2256.c
37 lines (30 loc) · 993 Bytes
/
2256.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
// Prefix sum.
// - Calculate whole nums sum.
// - Calculate currIndex sum.
// - Compare averages
// Runtime: O(n)
// Space: O(1)
int minimumAverageDifference(int* nums, int numsSize){
long numsSum = 0;
for (int i = 0; i < numsSize; i++){
numsSum += nums[i];
}
long currSum = 0;
long minAverage = 9223372036854775807; // Long max
int minIndex = 0;
for (int i = 0; i < numsSize; i++){
currSum += nums[i];
int leftItemsNumber = (numsSize - i - 1);
long leftItemsNumberAverage = 0;
if (leftItemsNumber != 0){
leftItemsNumberAverage = (numsSum - currSum) / leftItemsNumber;
}
long currItemsNumberAverage = currSum / (i + 1);
long averageDiff = abs(currItemsNumberAverage - leftItemsNumberAverage);
if (averageDiff < minAverage){
minAverage = averageDiff;
minIndex = i;
}
}
return minIndex;
}