class Solution {
public:
int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
int num=gas.size();
int visited=0;
int sum;
int i,j;
for(i=0;i<num&&visited<num;i++)
{
sum=0;
visited++;
for(j=i;j<i+num;j++)
{
sum+=gas[j%num]-cost[j%num];
if(sum<0)
{
i=j%num;//let i jump to the station j
visited+=j-i;
break;
}
}
if(sum>=0)
return i;
}
return -1;
}
};
leetcode 134: Gas Station
最新推荐文章于 2022-01-25 22:34:26 发布