Skip to content
/ leetcode Public
  • Sponsor doocs/leetcode

  • Notifications You must be signed in to change notification settings
  • Fork 9.1k
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.

Commit 67e39b5

Browse files
authoredJun 3, 2025··
Merge branch 'main' into main
2 parents db6e8f1 + 297e28c commit 67e39b5

File tree

88 files changed

+1077
-1159
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

88 files changed

+1077
-1159
lines changed
 

‎solution/0100-0199/0134.Gas Station/README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -57,10 +57,10 @@ tags:
5757
<p><strong>提示:</strong></p>
5858

5959
<ul>
60-
<li><code>gas.length == n</code></li>
61-
<li><code>cost.length == n</code></li>
60+
<li><code>n == gas.length == cost.length</code></li>
6261
<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
6362
<li><code>0 &lt;= gas[i], cost[i] &lt;= 10<sup>4</sup></code></li>
63+
<li>输入保证答案唯一。</li>
6464
</ul>
6565

6666
<!-- description:end -->

‎solution/0100-0199/0134.Gas Station/README_EN.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -60,6 +60,7 @@ Therefore, you can&#39;t travel around the circuit once no matter where you star
6060
<li><code>n == gas.length == cost.length</code></li>
6161
<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
6262
<li><code>0 &lt;= gas[i], cost[i] &lt;= 10<sup>4</sup></code></li>
63+
<li>The input is generated such that the answer is unique.</li>
6364
</ul>
6465

6566
<!-- description:end -->

0 commit comments

Comments
 (0)
Please sign in to comment.