Find Missing Observations LeetCode solution in Java

1
class Solution {
2
  public int[] missingRolls(int[] rolls, int mean, int n) {
3

4
    int i, m = rolls.length, sum = 0;
5
    for (i = 0; i < m; i++) sum += rolls[i];
6

7
    int x = (mean * (m + n)) - sum;
8

9
    if (x <= 0 || n * 6 < x || ((x / n) == 0)) {
10
      return new int[] {};
11
    }
12

13
    int arr[] = new int[n];
14

15
    int p = x / n, q = x % n;
16
    for (i = 0; i < n; i++) {
17

18
      arr[i] = p + (q > 0 ? 1 : 0);
19
      q--;
20
    }
21
    return arr;
22
  }
23
}