Alawn/Interview-Notebook
1
0
Fork 0
mirror of https://github.com/CyC2018/Interview-Notebook.git synced 2026-10-26 21:13:43 +00:00
Code Issues Releases Wiki Activity

Update 47. 礼物的最大价值.md

Browse Source 
代码块标注语言。
This commit is contained in:
CyC2018
2026-10-25 19:03:37 +08:00
parent b37f62388d
commit ad33445263
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
notes/47. 礼物的最大价值.md
+1 -1
View File
@@ -6,7 +6,7 @@
在一个 m\*n 的棋盘的每一个格都放有一个礼物，每个礼物都有一定价值（大于 0）。从左上角开始拿礼物，每次向右或向下移动一格，直到右下角结束。给定一个棋盘，求拿到礼物的最大价值。例如，对于如下棋盘
```
```text
1 10 3 8
12 2 9 6
5 7 4 11