update

leetcode-cn/originData/li-wu-de-zui-da-jie-zhi-lcof.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>在一个 m*n 的棋盘的每一格都放有一个礼物，每个礼物都有一定的价值（价值大于 0）。你可以从棋盘的左上角开始拿格子里的礼物，并每次向右或者向下移动一格、直到到达棋盘的右下角。给定一个棋盘及其上面的礼物的价值，请计算你最多能拿到多少价值的礼物？</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre><strong>输入:</strong> \n<code>[\n&nbsp; [1,3,1],\n&nbsp; [1,5,1],\n&nbsp; [4,2,1]\n]</code>\n<strong>输出:</strong> <code>12\n</code><strong>解释:</strong> 路径 1&rarr;3&rarr;5&rarr;2&rarr;1 可以拿到最多价值的礼物</pre>\n\n<p>&nbsp;</p>\n\n<p>提示：</p>\n\n<ul>\n\t<li><code>0 &lt; grid.length &lt;= 200</code></li>\n\t<li><code>0 &lt; grid[0].length &lt;= 200</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 272,
+            "likes": 273,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"165.5K\", \"totalSubmission\": \"239.7K\", \"totalAcceptedRaw\": 165503, \"totalSubmissionRaw\": 239665, \"acRate\": \"69.1%\"}",
+            "stats": "{\"totalAccepted\": \"166.3K\", \"totalSubmission\": \"240.7K\", \"totalAcceptedRaw\": 166253, \"totalSubmissionRaw\": 240723, \"acRate\": \"69.1%\"}",
             "hints": [],
             "solution": null,
             "status": null,