标签:next att class and 返回 gas car amp 一周
134. Gas Station
There are N gas stations along a circular route, where the amount of gas at station iis gas[i]
.
You have a car with an unlimited gas tank and it costs cost[i]
of gas to travel from station i to its next station (i+1). You begin the journey with an empty tank at one of the gas stations.
Return the starting gas station‘s index if you can travel around the circuit once in the clockwise direction, otherwise return -1.
Note:
Example 1:
Input: gas = [1,2,3,4,5] cost = [3,4,5,1,2] Output: 3 Explanation: Start at station 3 (index 3) and fill up with 4 unit of gas. Your tank = 0 + 4 = 4 Travel to station 4. Your tank = 4 - 1 + 5 = 8 Travel to station 0. Your tank = 8 - 2 + 1 = 7 Travel to station 1. Your tank = 7 - 3 + 2 = 6 Travel to station 2. Your tank = 6 - 4 + 3 = 5 Travel to station 3. The cost is 5. Your gas is just enough to travel back to station 3. Therefore, return 3 as the starting index.
Example 2:
Input: gas = [2,3,4] cost = [3,4,3] Output: -1 Explanation: You can‘t start at station 0 or 1, as there is not enough gas to travel to the next station. Let‘s start at station 2 and fill up with 4 unit of gas. Your tank = 0 + 4 = 4 Travel to station 0. Your tank = 4 - 3 + 2 = 3 Travel to station 1. Your tank = 3 - 3 + 3 = 3 You cannot travel back to station 2, as it requires 4 unit of gas but you only have 3. Therefore, you can‘t travel around the circuit once no matter where you start.
题意:给定每个站的汽油补给量和花费量,问从哪个站开始出发可以环绕一周,若所有站都不满足则返回-1
代码如下:
/** * @param {number[]} gas * @param {number[]} cost * @return {number} */ var canCompleteCircuit = function(gas, cost) { let sum=0,total=0,start=0; for(let i=0;i<gas.length;i++){ sum+=gas[i]-cost[i]; total+=gas[i]-cost[i]; if(sum<0){ sum=0; start=i+1; } } return total<0?-1:start; };
标签:next att class and 返回 gas car amp 一周
原文地址:https://www.cnblogs.com/xingguozhiming/p/10946802.html