Fair Distribution of Cookies LeetCode solution in Java

1
class Solution {
2
  int ans;
3
  int count[];
4

5
  public int distributeCookies(int[] cookies, int k) {
6
    ans = Integer.MAX_VALUE;
7
    count = new int[k];
8

9
    backtrack(0, cookies, k);
10
    return ans;
11
  }
12

13
  public void backtrack(int cookieNumber, int[] cookies, int k) {
14
    if (cookieNumber == cookies.length) {
15
      int max = 0;
16
      for (int i = 0; i < k; i++) {
17
        max = Math.max(max, count[i]);
18
      }
19
      ans = Math.min(ans, max);
20
      return;
21
    }
22
    for (int i = 0; i < k; i++) {
23
      count[i] += cookies[cookieNumber];
24
      backtrack(cookieNumber + 1, cookies, k);
25
      count[i] -= cookies[cookieNumber];
26
      if (count[i] == 0) break;
27
    }
28
  }
29
}