一开始用搜索写,超时了,看了题解后才想到的dp
我是废物QAQ
dp[i][j][k]代表从起点开始走了i步到了(j,k)的走法数量
dp[i][j][k]等于前一步的上下左右四个方位的和
class Solution {
public int findPaths(int m, int n, int maxMove, int startRow, int startColumn) {
final int mod = 1000000007;
final int[][] direction = {{0,1}, {0,-1}, {1,0}, {-1,0}};
int ans = 0;
int[][][] dp = new int[51][51][51];
dp[0][startRow][startColumn] = 1;
for (int i = 0; i < maxMove; i++) {
for (int j = 0; j < m; j++) {
for (int k = 0; k < n; k++) {
int cnt = dp[i][j][k];
if(cnt != 0) {
for (int d = 0; d < direction.length; d++) {
int nowX = j+direction[d][0];
int nowY = k+direction[d][1];
if(nowX >=0 && nowX < m && nowY >= 0 && nowY < n) {
dp[i+1][nowX][nowY] = (dp[i+1][nowX][nowY] + cnt) % mod;
} else {
ans = (ans + cnt) % mod;
}
}
}
}
}
}
return ans;
}
}