Fair Distribution of Cookies LeetCode solution in C++

1
class Solution {
2
 public:
3
  int ans = INT_MAX;
4
  void solve(int start, vector<int> &nums, vector<int> &v, int k) {
5
    if (start == nums.size()) {
6
      int maxm = INT_MIN;
7
      for (int i = 0; i < k; i++) {
8
        maxm = max(maxm, v[i]);
9
      }
10
      ans = min(ans, maxm);
11
      return;
12
    }
13
    for (int i = 0; i < k; i++) {
14
      v[i] += nums[start];
15
      solve(start + 1, nums, v, k);
16
      v[i] -= nums[start];
17
    }
18
  }
19

20
  int distributeCookies(vector<int> &nums,
21
                        int k) { // nums is the cookies vector
22
    int n = nums.size();
23
    vector<int> v(k, 0); // v is to store each sum of the k subsets
24
    solve(0, nums, v, k);
25
    return ans;
26
  }
27
};