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
In the end of
leetcode/C++/chapDFS.tex line263 一个$m$行,$n$列的矩阵,机器人从左上走到右下总共需要的步数是$m+n-2$,其中向下走的步数是$m-1$,因此问题变成了在$m+n-2$个操作中,选择$m–1$个时间点向下走,选择方式有多少种。即 $C_{m+n-2}^{m-1}$ 。
$C_{m+n-2}^{m-1} would present like
m - 1 C m + n - 2
But it should be
m + n - 2 C m - 1
Right? Or your country have different usage of C(m, n)?
If it is a typo, please change it to
一个$m$行,$n$列的矩阵,机器人从左上走到右下总共需要的步数是$m+n-2$,其中向下走的步数是$m-1$,因此问题变成了在$m+n-2$个操作中,选择$m–1$个时间点向下走,选择方式有多少种。即 $C_{m-1}^{m+n-2}$
The text was updated successfully, but these errors were encountered:
No branches or pull requests
In the end of
leetcode/C++/chapDFS.tex line263$C_{m+n-2}^{m-1}$ 。
一个$m$行,$n$列的矩阵,机器人从左上走到右下总共需要的步数是$m+n-2$,其中向下走的步数是$m-1$,因此问题变成了在$m+n-2$个操作中,选择$m–1$个时间点向下走,选择方式有多少种。即
$C_{m+n-2}^{m-1} would present like
m - 1
C m + n - 2
But it should be
m + n - 2
C m - 1
Right? Or your country have different usage of C(m, n)?
If it is a typo, please change it to
一个$m$行,$n$列的矩阵,机器人从左上走到右下总共需要的步数是$m+n-2$,其中向下走的步数是$m-1$,因此问题变成了在$m+n-2$个操作中,选择$m–1$个时间点向下走,选择方式有多少种。即$C_{m-1}^{m+n-2}$
The text was updated successfully, but these errors were encountered: