https://leetcode.com/problems/knight-probability-in-chessboard/description/
Problem:
On an NxN chessboard, a knight starts at the r-th row and c-th column and attempts to make exactly Kmoves. The rows and columns are 0 indexed, so the top-left square is (0, 0), and the bottom-right square is (N-1, N-1).
A chess knight has 8 possible moves it can make, as illustrated below. Each move is two squares in a cardinal direction, then one square in an orthogonal direction.
Each time the knight is to move, it chooses one of eight possible moves uniformly at random (even if the piece would go off the chessboard) and moves there.
The knight continues moving until it has made exactly K moves or has moved off the chessboard. Return the probability that the knight remains on the board after it has stopped moving.
Example:
|
1 2 3 4 5 |
Input: 3, 2, 0, 0 Output: 0.0625 Explanation: There are two moves (to (1,2), (2,1)) that will keep the knight on the board. From each of those positions, there are also two moves that will keep the knight on the board. The total probability the knight stays on the board is 0.0625. |
Note:
Nwill be between 1 and 25.Kwill be between 0 and 100.- The knight always initially starts on the board.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 |
// Author: Huahua // Runtime: 6 ms class Solution { public: double knightProbability(int N, int K, int r, int c) { vector<vector<double>> dp0(N, vector<double>(N, 0.0)); dp0[r][c] = 1.0; int dirs[8][2] = {{1, 2}, {-1, -2}, {1, -2}, {-1, 2}, {2, 1}, {-2, -1}, {2, -1}, {-2, 1}}; for (int k = 0; k < K; ++k) { vector<vector<double>> dp1(N, vector<double>(N, 0.0)); for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) for (int m = 0; m < 8; ++m) { int x = j + dirs[m][0]; int y = i + dirs[m][1]; if (x < 0 || y < 0 || x >= N || y >= N) continue; dp1[i][j] += dp0[y][x]; } std::swap(dp0, dp1); } double total = 0; for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) total += dp0[i][j]; return total / pow(8, K); } }; |
Related problems:
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
huahualeetcode
Be First to Comment