Skip to content

Commit a1a8300

Browse files
committed
Create README - LeetHub
source:ced4088d42783c95ff7b5f3070fde81f675f2ab2
1 parent 2d560d9 commit a1a8300

1 file changed

Lines changed: 45 additions & 0 deletions

File tree

Lines changed: 45 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,45 @@
1+
<h2><a href="https://leetcode.com/problems/gas-station">134. Gas Station</a></h2><h3>Medium</h3><hr><p>There are <code>n</code> gas stations along a circular route, where the amount of gas at the <code>i<sup>th</sup></code> station is <code>gas[i]</code>.</p>
2+
3+
<p>You have a car with an unlimited gas tank and it costs <code>cost[i]</code> of gas to travel from the <code>i<sup>th</sup></code> station to its next <code>(i + 1)<sup>th</sup></code> station. You begin the journey with an empty tank at one of the gas stations.</p>
4+
5+
<p>Given two integer arrays <code>gas</code> and <code>cost</code>, return <em>the starting gas station&#39;s index if you can travel around the circuit once in the clockwise direction, otherwise return</em> <code>-1</code>. If there exists a solution, it is <strong>guaranteed</strong> to be <strong>unique</strong>.</p>
6+
7+
<p>&nbsp;</p>
8+
<p><strong class="example">Example 1:</strong></p>
9+
10+
<pre>
11+
<strong>Input:</strong> gas = [1,2,3,4,5], cost = [3,4,5,1,2]
12+
<strong>Output:</strong> 3
13+
<strong>Explanation:</strong>
14+
Start at station 3 (index 3) and fill up with 4 unit of gas. Your tank = 0 + 4 = 4
15+
Travel to station 4. Your tank = 4 - 1 + 5 = 8
16+
Travel to station 0. Your tank = 8 - 2 + 1 = 7
17+
Travel to station 1. Your tank = 7 - 3 + 2 = 6
18+
Travel to station 2. Your tank = 6 - 4 + 3 = 5
19+
Travel to station 3. The cost is 5. Your gas is just enough to travel back to station 3.
20+
Therefore, return 3 as the starting index.
21+
</pre>
22+
23+
<p><strong class="example">Example 2:</strong></p>
24+
25+
<pre>
26+
<strong>Input:</strong> gas = [2,3,4], cost = [3,4,3]
27+
<strong>Output:</strong> -1
28+
<strong>Explanation:</strong>
29+
You can&#39;t start at station 0 or 1, as there is not enough gas to travel to the next station.
30+
Let&#39;s start at station 2 and fill up with 4 unit of gas. Your tank = 0 + 4 = 4
31+
Travel to station 0. Your tank = 4 - 3 + 2 = 3
32+
Travel to station 1. Your tank = 3 - 3 + 3 = 3
33+
You cannot travel back to station 2, as it requires 4 unit of gas but you only have 3.
34+
Therefore, you can&#39;t travel around the circuit once no matter where you start.
35+
</pre>
36+
37+
<p>&nbsp;</p>
38+
<p><strong>Constraints:</strong></p>
39+
40+
<ul>
41+
<li><code>n == gas.length == cost.length</code></li>
42+
<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
43+
<li><code>0 &lt;= gas[i], cost[i] &lt;= 10<sup>4</sup></code></li>
44+
<li>The input is generated such that the answer is unique.</li>
45+
</ul>

0 commit comments

Comments
 (0)