Cherry Pickup II

Given a rows x cols matrix grid representing a field of cherries. Each cell in grid represents the number of cherries that you can collect.

You have two robots that can collect cherries for you, Robot #1 is located at the top-left corner (0,0) , and Robot #2 is located at the top-right corner (0, cols-1) of the grid.

Return the maximum number of cherries collection using both robots  by following the rules below:

• From a cell (i,j), robots can move to cell (i+1, j-1) , (i+1, j) or (i+1, j+1).
• When any robot is passing through a cell, It picks it up all cherries, and the cell becomes an empty cell (0).
• When both robots stay on the same cell, only one of them takes the cherries.
• Both robots cannot move outside of the grid at any moment.
• Both robots should reach the bottom row in the grid.

Example 1:

Input: grid = [[3,1,1],[2,5,1],[1,5,5],[2,1,1]]
Output: 24
Explanation: Path of robot #1 and #2 are described in color green and blue respectively.
Cherries taken by Robot #1, (3 + 2 + 5 + 2) = 12.
Cherries taken by Robot #2, (1 + 5 + 5 + 1) = 12.
Total of cherries: 12 + 12 = 24.

Example 2:

Input: grid = [[1,0,0,0,0,0,1],[2,0,0,0,0,3,0],[2,0,9,0,0,0,0],[0,3,0,5,4,0,0],[1,0,2,3,0,0,6]]
Output: 28
Explanation: Path of robot #1 and #2 are described in color green and blue respectively.
Cherries taken by Robot #1, (1 + 9 + 5 + 2) = 17.
Cherries taken by Robot #2, (1 + 3 + 4 + 3) = 11.
Total of cherries: 17 + 11 = 28.

Example 3:

Input: grid = [[1,0,0,3],[0,0,0,3],[0,0,3,3],[9,0,3,3]]
Output: 22

Example 4:

Input: grid = [[1,1],[1,1]]
Output: 4

Constraints:

• rows == grid.length
• cols == grid[i].length
• 2 <= rows, cols <= 70
• 0 <= grid[i][j] <= 100 

思路：top down dp，想最后一步，两个机器人假设从 1 ~ n - 1全部已经搞定了，那么从当前往下，会有9种可能，下去。取9种可能性里面最大的，往下走。如果c1 == c2, 那么就加一个值，如果c1 != c2, 那么 就收集两个，加两个cell的值；注意dp array是三维的，而且是用Integer来表示，可以dp[row][c1][c2] != null, return;

class Solution {
    public int cherryPickup(int[][] grid) {
        if(grid == null || grid.length == 0 || grid[0].length == 0) {
            return 0;
        }
        int m = grid.length;
        int n = grid[0].length;
        int[][][] cache = new int[m][n][n];
        return dfs(grid, 0, 0, n - 1, cache, m, n);
    }
    
    private int dfs(int[][] grid, int row, int col1, int col2, int[][][] cache, int m, int n) {
        if(row == m) {
            return 0;
        }
        if(cache[row][col1][col2] != 0) {
            return cache[row][col1][col2];
        }
        int value = 0;
        for(int i = -1; i <= 1; i++) {
            for(int j = -1; j <= 1; j++) {
                int ncol1 = col1 + i;
                int ncol2 = col2 + j;
                if(0 <= ncol1 && ncol1 < n && 0 <= ncol2 && ncol2 < n) {
                    value = Math.max(value, dfs(grid, row + 1, ncol1, ncol2, cache, m, n));
                }
            }
        }
        
        // 最后一步，从9个状态里面最大的那个来到当前的格子,[row][col1][col2];
        value += grid[row][col1];
        if(col1 != col2) {
            value += grid[row][col2];
        }
        cache[row][col1][col2] = value;
        return cache[row][col1][col2];
    }
}