Get Missing Dice Rolls Problem

Solution.java

public class Solution {

    static int[] solution(int[] A, int F, int M) {
        int aLength = A.length;
        int aSum = 0;
        for (int value : A) {
            aSum += value; // sum of values in array A 
        }

        int totalSum = M * (F + aLength); // the mean multiplied 
        // by the total number of values in A and F give you the total sum 

        int fSum = totalSum - aSum; // now we can deduce the sum of values in F
        if (fSum < F || fSum > 6 * F) { 
            // it's not possible to find an array F satisfying the condition
            // if any of those conditions hold 
            // try to convince yourself 
            int emptyResult[] = {0};
            return emptyResult;
        }

        int result[] = new int[F];
        for (int i = 0; i < F; i++) {
            int chosenValue = 1;
            for (int value = 1; value <= 6; value++) {
                // try to put the current value 
                // only if you will still be able to place at least 
                // 1 for other positions
                if (fSum - value >= F - i - 1) {
                    chosenValue = value;
                }
            }
            result[i] = chosenValue;
            fSum -= chosenValue;
        }

        return result;
    }

    public static void main(String[] args) {
        int[] A = {1, 5, 6};
        int[] result = solution(A, 4, 3);
        for (int value : result) {
            System.out.print(value + " ");
        }
    }
}