首页 > 代码库 > Gas Station
Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is 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, otherwise return -1.
Note:
The solution is guaranteed to be unique.
class Solution {public: int canCompleteCircuit(vector<int> &gas, vector<int> &cost) { int len = gas.size(); int ind = 0; int remain = 0; int hold = 0; bool flag = false; for(int i=0;i<len;i++){ int r = gas[i]-cost[i]; remain += r; if(flag == false && r > 0){ ind = i; flag = true; hold = hold + remain; remain = 0; } if(remain < 0) flag = false; } if(hold + remain >= 0) return ind; else return -1; }};
Gas Station
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。