We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 54ac029 commit 07da423Copy full SHA for 07da423
doc/ms/ms.md
@@ -71,4 +71,5 @@ dp(i, j)=min(dp(i−1, j), dp(i−1, j−1), dp(i, j−1))+1
71
此外,还需要考虑边界条件。如果 i 和 j 中至少有一个为 0,则以位置 (i, j) 为右下角的最大正方形的边长只能是 1,因此 dp(i, j)=1。
72
73
74
+
75

0 commit comments