CPMagical CP Library

Problem solution · C++

Maximum Fruits Harvested After at Most K Steps

Maximum Fruits Harvested After at Most K Steps: a C++ solution using sliding window or two pointers. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Sliding window or two pointers
Source
walkccc LeetCode Solutions
Length
37 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

Sliding window or two pointers

For Maximum Fruits Harvested After at Most K Steps, the implementation maintains a moving interval and updates only the information that enters or leaves the window.

  1. Choose the invariant that makes a window valid or useful.
  2. Advance the right boundary and add the new element.
  3. Move the left boundary only as needed while maintaining the invariant and updating the answer.

Code notes

  • 37 lines of C++ from the credited upstream file 2106.cpp.
  • The implementation visibly relies on sequence storage.
  • 3 loop blocks detected.

Complexity

Confirm that neither pointer moves backwards; if so, the scan is usually linear apart from the window’s data-structure operations.

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 codeMaximum Fruits Harvested After at Most K Steps · C++C++
Use this to learn the idea, then write your own version.
class Solution { public:  int maxTotalFruits(vector<vector<int>>& fruits, int startPos, int k) {    const int maxRight = max(startPos, fruits.back()[0]);    int ans = 0;    vector<int> amounts(1 + maxRight);    vector<int> prefix(2 + maxRight);     for (const vector<int>& f : fruits)      amounts[f[0]] = f[1];     partial_sum(amounts.begin(), amounts.end(), prefix.begin() + 1);     auto getFruits = [&](int leftSteps, int rightSteps) {      const int l = max(0, startPos - leftSteps);      const int r = min(maxRight, startPos + rightSteps);      return prefix[r + 1] - prefix[l];    };     // Go right first.    const int maxRightSteps = min(maxRight - startPos, k);    for (int rightSteps = 0; rightSteps <= maxRightSteps; ++rightSteps) {      const int leftSteps = max(0, k - 2 * rightSteps);  // Turn left      ans = max(ans, getFruits(leftSteps, rightSteps));    }     // Go left first.    const int maxLeftSteps = min(startPos, k);    for (int leftSteps = 0; leftSteps <= maxLeftSteps; ++leftSteps) {      const int rightSteps = max(0, k - 2 * leftSteps);  // Turn right      ans = max(ans, getFruits(leftSteps, rightSteps));    }     return ans;  }};

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 ↗