简单中等构造题 写了差不多 小问题 修修改改就ok
java:
class Solution {
public int[] missingRolls(int[] rolls, int mean, int n) {
int rsum = 0;
int m = rolls.length;
for(int i = 0; i < m; i++){
rsum += rolls[i];
}
int miss = mean * (m + n);
for(int roll : rolls){
miss -= roll;
}
if(miss < n || miss > 6 * n){
return new int[0];
}
int p = miss / n;
int q = miss % n;
int[] missing = new int[n];
for(int i = 0; i < n; i++){
missing[i] = p + (i < q ? 1 : 0);
}
return missing;
}
}



