mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-12 17:05:15 +08:00
update
This commit is contained in:
@@ -38,8 +38,8 @@
|
||||
<p><strong>提示:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>gas.length == n</code></li>
|
||||
<li><code>cost.length == n</code></li>
|
||||
<li><code>n == gas.length == cost.length</code></li>
|
||||
<li><code>1 <= n <= 10<sup>5</sup></code></li>
|
||||
<li><code>0 <= gas[i], cost[i] <= 10<sup>4</sup></code></li>
|
||||
<li>输入保证答案唯一。</li>
|
||||
</ul>
|
||||
|
Reference in New Issue
Block a user