Out of Boundary Paths 出界的路径

There is an m by n grid with a ball. Given the start coordinate (i,j) of the ball, you can move the ball to adjacent cell or cross the grid boundary in four directions (up, down, left, right). However, you can at most move N times. Find out the number of paths to move the ball out of grid boundary. The answer may be very large, return it after mod 109 + 7.

Example 1:

Input:m = 2, n = 2, N = 2, i = 0, j = 0
Output: 6
Explanation:


Example 2:

Input:m = 1, n = 3, N = 3, i = 0, j = 1
Output: 12
Explanation:


Note:

1. Once you move the ball out of boundary, you cannot move it back.
2. The length and height of the grid is in range [1,50].
3. N is in range [0,50].

class Solution {
public:
int findPaths(int m, int n, int N, int i, int j) {
vector<vector<vector<int>>> dp(N + 1, vector<vector<int>>(m, vector<int>(n, 0)));
for (int k = 1; k <= N; ++k) {
for (int x = 0; x < m; ++x) {
for (int y = 0; y < n; ++y) {
long long v1 = (x == 0) ? 1 : dp[k - 1][x - 1][y];
long long v2 = (x == m - 1) ? 1 : dp[k - 1][x + 1][y];
long long v3 = (y == 0) ? 1 : dp[k - 1][x][y - 1];
long long v4 = (y == n - 1) ? 1 : dp[k - 1][x][y + 1];
dp[k][x][y] = (v1 + v2 + v3 + v4) % 1000000007;
}
}
}
return dp[N][i][j];
}
};

class Solution {
public:
int findPaths(int m, int n, int N, int i, int j) {
int res = 0;
vector<vector<int>> dp(m, vector<int>(n, 0));
dp[i][j] = 1;
vector<vector<int>> dirs{{0,-1},{-1,0},{0,1},{1,0}};
for (int k = 0; k < N; ++k) {
vector<vector<int>> t(m, vector<int>(n, 0));
for (int r = 0; r < m; ++r) {
for (int c = 0; c < n; ++c) {
for (auto dir : dirs) {
int x = r + dir[0], y = c + dir[1];
if (x < 0 || x >= m || y < 0 || y >= n) {
res = (res + dp[r][c]) % 1000000007;
} else {
t[x][y] = (t[x][y] + dp[r][c]) % 1000000007;
}
}
}
}
dp = t;
}
return res;
}
};

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120