We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
第364天 构造一个自定义二维 NN 矩阵,从左上角第一个单元格依次填入1 - NN的数字,从矩阵中指定单元格出发,经过相邻的单元格(不可重复),走 X 步,输出所有可能的路径和每条路径单元格对应的数字。
作者:superSuperwang
我也要出题
示例:
当 N = 4,X = 7,从 1 出发时,经过的其中一条路径为: 1 --> 2 --> 3 --> 7 --> 11 --> 10 --> 14
The text was updated successfully, but these errors were encountered:
No branches or pull requests
第364天 构造一个自定义二维 NN 矩阵,从左上角第一个单元格依次填入1 - NN的数字,从矩阵中指定单元格出发,经过相邻的单元格(不可重复),走 X 步,输出所有可能的路径和每条路径单元格对应的数字。
作者:superSuperwang
我也要出题
示例:
当 N = 4,X = 7,从 1 出发时,经过的其中一条路径为:
1 --> 2 --> 3 --> 7 --> 11 --> 10 --> 14
The text was updated successfully, but these errors were encountered: