求助 ：741Cherry Pickup：采樱桃

这道题不理解啊，不是不理解他的思路，而是为什么换一种写法不能AC....

In a N x N grid representing a field of cherries, each cell is one of three possible integers.

• 0 means the cell is empty, so you can pass through;
• 1 means the cell contains a cherry, that you can pick up and pass through;
• -1 means the cell contains a thorn that blocks your way.

  Your task is to collect maximum number of cherries possible by following the rules below:

• Starting at the position (0, 0) and reaching (N-1, N-1) by moving right or down through valid path cells (cells with value 0 or 1);
• After reaching (N-1, N-1), returning to (0, 0) by moving left or up through valid path cells;
• When passing through a path cell containing a cherry, you pick it up and the cell becomes an empty cell (0);
• If there is no valid path between (0, 0) and (N-1, N-1), then no cherries can be collected.

  Example 1:
  

  Input: grid =
  [[0, 1, -1],
   [1, 0, -1],
   [1, 1,  1]]
  Output: 5
  Explanation: 
  The player started at (0, 0) and went down, down, right right to reach (2, 2).
  4 cherries were picked up during this single trip, and the matrix becomes [[0,1,-1],[0,0,-1],[0,0,0]].
  Then, the player went left, up, up, left to return home, picking up one more cherry.
  The total number of cherries picked up is 5, and this is the maximum possible.
  

  Note:

• grid is an N by N 2D array, with 1 <= N <= 50.
• Each grid[i][j] is an integer in the set {-1, 0, 1}.
• It is guaranteed that grid[0][0] and grid[N-1][N-1] are not -1.

解法：如下两种dp解法仅在road写法上不同，为什么会有结果上的不同，还请高人解释55555

class Solution {

	int[][][] road;
	int N;
	int[][] grid;

	public int cherryPickup(int[][] grid) {
		N = grid.length;
		this.grid = grid;
		road = new int[N][N][N];
		for (int[][] in : road) {
			for (int[] ins : in) {
				Arrays.fill(ins, Integer.MIN_VALUE);
			}
		}
		int res = Math.max(0, dp(0, 0, 0));      
		return res;
	}

    public int dp(int r1, int c1, int r2) {//不能AC的dp
		int c2 = r1 + c1 - r2;
		if (r1 == N || r2 == N || c1 == N || c2 == N || grid[r1][c1] == -1 || grid[r2][c2] == -1) {
			return -999999;
		} else if (r1 == N - 1 && c1 == N - 1) {
			return grid[r1][c1];
		} else if (road[r1][c1][r2] != Integer.MIN_VALUE) {
			return road[r1][c1][r2];
		} else {
			int res = grid[r1][c1];
			if (c1 != c2 )
				res += grid[r2][c2];
			//下下，下右，右下，右右
			res += Math.max(Math.max(dp(r1 + 1, c1, r2 + 1), dp(r1 + 1, c1, r1 )), Math.max(dp(r1 , c1 + 1, r2 + 1), dp(r1 , c1 + 1, r2 )));
			road[r1][c1][r2] = res;
			return res;
		}
	}
    
	public int dp1(int r1, int c1, int c2) {//可以AC的dp
		int r2 = r1 + c1 - c2;
		if (r1 == N || r2 == N || c1 == N || c2 == N || grid[r1][c1] == -1 || grid[r2][c2] == -1) {
			return -999999;
		} else if (r1 == N - 1 && c1 == N - 1) {
			return grid[r1][c1];
		} else if (road[r1][c1][c2] != Integer.MIN_VALUE) {
			return road[r1][c1][c2];
		} else {
			int res = grid[r1][c1];
			if (r1 != r2 )
				res += grid[r2][c2];
			//下下，下右，右下，右右
			res += Math.max(Math.max(dp(r1 + 1, c1, c2), dp(r1 + 1, c1, c2 + 1 )), Math.max(dp(r1 , c1 + 1, c2 ), dp(r1 , c1 + 1, c2 +1)));          
			road[r1][c1][c2] = res;
			return res;
		}
	}
//why？为什么会有差别？？？？？？
}