CPMagical CP Library

Problem solution · C++

Minimize the Difference Between Target and Chosen Elements

Minimize the Difference Between Target and Chosen Elements: a C++ solution using direct simulation. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Direct simulation
Source
walkccc LeetCode Solutions
Length
38 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Direct simulation

For Minimize the Difference Between Target and Chosen Elements, the implementation follows the problem’s operations directly while maintaining only the state needed for the next decision.

  1. Translate each rule into one explicit state update.
  2. Maintain the invariant after every processed item.
  3. Return the accumulated state once all relevant input has been handled.

Code notes

  • 38 lines of C++ from the credited upstream file 1981.cpp.
  • The implementation visibly relies on sequence storage.
  • 1 loop block detected.

Complexity

Count the number and nesting of passes over the input, then include the maintained containers in the memory estimate.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeMinimize the Difference Between Target and Chosen Elements · C++C++
Use this to learn the idea, then write your own version.
class Solution { public:  int minimizeTheDifference(vector<vector<int>>& mat, int target) {    const int minSum = getMinSum(mat);    if (minSum >= target)  // No need to consider any larger combination.      return minSum - target;     const int maxSum = getMaxSum(mat);    vector<vector<int>> mem(mat.size(), vector<int>(maxSum + 1, -1));    return minimizeTheDifference(mat, 0, 0, target, mem);  }  private:  int minimizeTheDifference(const vector<vector<int>>& mat, int i, int sum,                            int target, vector<vector<int>>& mem) {    if (i == mat.size())      return abs(sum - target);    if (mem[i][sum] != -1)      return mem[i][sum];    int res = INT_MAX;    for (const int num : mat[i])      res = min(res, minimizeTheDifference(mat, i + 1, sum + num, target, mem));    return mem[i][sum] = res;  }   int getMinSum(const vector<vector<int>>& mat) {    return accumulate(        mat.begin(), mat.end(), 0,        [](int acc, const vector<int>& row) { return acc + ranges::min(row); });  }   int getMaxSum(const vector<vector<int>>& mat) {    return accumulate(        mat.begin(), mat.end(), 0,        [](int acc, const vector<int>& row) { return acc + ranges::max(row); });  }};

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗