CPMagical CP Library

Problem solution · Python

Cherry Pickup

Cherry Pickup: a Python solution using dynamic programming. Learn the idea, check the complexity, and read the full code, with credit to Kamyu LeetCode Solutions.

Technique
Dynamic programming
Source
Kamyu LeetCode Solutions
Length
35 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

Dynamic programming

For Cherry Pickup, the implementation records answers for smaller states and reuses them to build the requested result without repeating work.

  1. Define precisely what one DP state represents.
  2. Establish the base cases before transitions are evaluated.
  3. Process states in dependency order and combine only already-known values.

Code notes

  • 35 lines of Python from the credited upstream file cherry-pickup.py.
  • The implementation visibly relies on sequence storage, cached states.
  • No explicit loop blocks detected.

Complexity

Multiply the number of reachable states by the work performed for each transition, then include the stored state table in memory usage.

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

Source

Code and credit

This code comes from Kamyu LeetCode Solutions by kamyu104 and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeCherry Pickup · PythonPython
Use this to learn the idea, then write your own version.
# Time:  O(n^3)# Space: O(n^2) class Solution(object):    def cherryPickup(self, grid):        """        :type grid: List[List[int]]        :rtype: int        """        # dp holds the max # of cherries two k-length paths can pickup.        # The two k-length paths arrive at (i, k - i) and (j, k - j),        # respectively.        n = len(grid)        dp = [[-1 for _ in xrange(n)] for _ in xrange(n)]        dp[0][0] = grid[0][0]        max_len = 2 * (n-1)        directions = [(0, 0), (-1, 0), (0, -1), (-1, -1)]        for k in xrange(1, max_len+1):            for i in reversed(xrange(max(0, k-n+1), min(k+1, n))):  # 0 <= i < n, 0 <= k-i < n                for j in reversed(xrange(i, min(k+1, n))):          # i <= j < n, 0 <= k-j < n                    if grid[i][k-i] == -1 or grid[j][k-j] == -1:                        dp[i][j] = -1                        continue                    cnt = grid[i][k-i]                    if i != j:                        cnt += grid[j][k-j]                    max_cnt = -1                    for direction in directions:                        ii, jj = i+direction[0], j+direction[1]                        if ii >= 0 and jj >= 0 and dp[ii][jj] >= 0:                            max_cnt = max(max_cnt, dp[ii][jj]+cnt)                    dp[i][j] = max_cnt        return max(dp[n-1][n-1], 0)

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 ↗