688. Knight Probability in Chessboard
来源:互联网 发布:洛阳青峰网络 编辑:程序博客网 时间:2024/05/24 04:14
688. Knight Probability in Chessboard
题目描述:On an
N
xN
chessboard, a knight starts at ther
-th row andc
-th column and attempts to make exactlyK
moves. 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:
Input: 3, 2, 0, 0Output: 0.0625Explanation: 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.
题目大意:给定一个N*N的棋盘,骑士每次只能在8个方向随机的选择一个方向移动,问经过K步之后,骑士是否还在棋盘内。
代码
package DP;/*** @Author OovEver* @Date 2017/12/16 14:29*/public class LeetCode688 { int[][] moves = {{1, 2}, {1, -2}, {2, 1}, {2, -1}, {-1, 2}, {-1, -2}, {-2, 1}, {-2, -1}}; public double knightProbability(int N, int K, int r, int c) { double[][][] dp = new double[K + 1][N][N]; return helper(dp, N, K, r, c) / Math.pow(8.0, K); } private double helper(double[][][] dp, int N, int k, int r, int c) { if(r<0||r>=N||c<0||c>=N) return 0.0; if (k == 0) { return 1.0; }// 如果遇到之前遍历过的直接返回 if (dp[k][r][c] != 0.0) return dp[k][r][c]; for(int i=0;i<8;i++) { dp[k][r][c] += helper(dp, N, k - 1, r + moves[i][0], c + moves[i][1]); } return dp[k][r][c]; }}
- 688. Knight Probability in Chessboard
- 688. Knight Probability in Chessboard
- 688. Knight Probability in Chessboard
- 688. Knight Probability in Chessboard
- Knight Probability in Chessboard
- LWC 52:688. Knight Probability in Chessboard
- [LeetCode] 688. Knight Probability in Chessboard
- leetcode 688. Knight Probability in Chessboard
- 【第十二周】688. Knight Probability in Chessboard
- (M)Dynamic Programming:688. Knight Probability in Chessboard
- Knight Probability in Chessboard问题及解法
- Leetcode——Knight Probability in Chessboard
- leetcode编程记录12 #688 Knight Probability in Chessboard
- 算法课作业系列8——Knight Probability in Chessboard
- Knight Probability in Chessboard:棋盘上计算K步之后棋子仍在棋盘上的概率
- Knights in Chessboard
- lightoj-1010-Knights in Chessboard
- LightOJ 1010 Knights in Chessboard
- 判断是否是素数
- 编写高效的C++程序
- 168. Excel Sheet Column Title
- MVP 详解(上)
- Batch Normalization的作用
- 688. Knight Probability in Chessboard
- 让超出DIV宽度范围的文字自动显示省略号...
- Geo-Plus.VisionLidar.v28.0.01.33.60.Win64 1CD
- 111. Minimum Depth of Binary Tree
- Spring CommonsMultipartResolver 上传文件
- 画画一样开发软件 TERSUS无代码开发工具安装及使用介绍
- yml配置
- 指针函数完成两个数交换
- CLISP 记录: 31. 平台不相关的扩展