|2028|[Find Missing Observations](https://leetcode.com/problems/find-missing-observations/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2028.java) ||Medium||

package com.fishercoder.solutions;

public class _2028 {

public static class Solution1 {

public int[] missingRolls(int[] rolls, int mean, int n) {

long sum = 0l;

for (int num : rolls) {

sum += num;

}

long totalSum = (rolls.length + n) * mean;

long remainder = totalSum - sum;

if (remainder / n > 6 || (remainder / n == 6 && remainder % n != 0) || remainder / n < 0 || remainder < n) {

return new int[]{};

}

int ave = (int) (remainder / n);

int remain = (int) (remainder % n);

int[] ans = new int[n];

int k = 0;

while (k < n) {

ans[k++] = ave + remain > 0 ? 1 : 0;

remain--;

}

return ans;

}

}

}

package com.fishercoder;

import com.fishercoder.solutions._2028;

import org.junit.BeforeClass;

import org.junit.Test;

import static org.junit.Assert.assertArrayEquals;

public class _2028Test {

private static _2028.Solution1 solution1;

@BeforeClass

public static void setup() {

solution1 = new _2028.Solution1();

}

@Test

public void test1() {

assertArrayEquals(new int[]{}, solution1.missingRolls(new int[]{4, 2, 2, 5, 4, 5, 4, 5, 3, 3, 6, 1, 2, 4, 2, 1, 6, 5, 4, 2, 3, 4, 2, 3, 3, 5, 4, 1, 4, 4, 5, 3, 6, 1, 5, 2, 3, 3, 6, 1, 6, 4, 1, 3}, 2, 53));

}

}