mirror of
https://gitlab.com/mfocko/LeetCode.git
synced 2024-11-14 18:07:32 +01:00
23 lines
552 B
C#
23 lines
552 B
C#
|
public class Solution {
|
||
|
public int[] MissingRolls(int[] rolls, int mean, int n) {
|
||
|
var sum = rolls.Sum();
|
||
|
|
||
|
var remainder = (rolls.Length + n) * mean - sum;
|
||
|
if (remainder < n || remainder > 6 * n) {
|
||
|
// cannot construct such rolls
|
||
|
return [];
|
||
|
}
|
||
|
|
||
|
var (roll, unmatched) = (remainder / n, remainder % n);
|
||
|
|
||
|
var missing = new int[n];
|
||
|
Array.Fill(missing, roll);
|
||
|
|
||
|
for (int i = 0; i < unmatched; ++i) {
|
||
|
++missing[i];
|
||
|
}
|
||
|
|
||
|
return missing;
|
||
|
}
|
||
|
}
|