mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-13 01:15:14 +08:00
update
This commit is contained in:
@@ -41,4 +41,5 @@ Therefore, you can't travel around the circuit once no matter where you star
|
||||
<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>The input is generated such that the answer is unique.</li>
|
||||
</ul>
|
||||
|
Reference in New Issue
Block a user