Maximum number of groups that can receive fresh donuts distributed in batches of size K

import java.io.*;import java.util.*;class GFG {            static HashMap memo;                public static int dfs(int[] V,                          int left, int K)    {                        int q = 0;                                String key = Arrays.toString(V);        key += Integer.toString(left);                if (memo.containsKey(key))            return memo.get(key);                else if (left == 0) {                        for (int i = 1; i < K; ++i)                if (V[i] > 0) {                                        V[i]–;                                                            q = Math.max(                        q, 1 + dfs(V, K – i, K));                                        V[i]++;                }        }                        else {            for (int i = 1; i < K; ++i) {                if (V[i] > 0) {                                        V[i]–;                    int nleft = i