mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
存量题库数据更新
This commit is contained in:
@@ -16,7 +16,7 @@
|
||||
</ul>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/grid.jpg" style="width: 242px; height: 242px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> grid = [[0,1,-1],[1,0,-1],[1,1,1]]
|
||||
@@ -27,7 +27,7 @@ Then, the player went left, up, up, left to return home, picking up one more che
|
||||
The total number of cherries picked up is 5, and this is the maximum possible.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> grid = [[1,1,-1],[1,-1,1],[-1,1,1]]
|
||||
|
Reference in New Issue
Block a user