# [leetcode] 134. Gas Station

64人阅读 评论(0)

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.

dp解法没有通过OJ testtime。

class Solution {
public:
int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
int len = gas.size();
vector<int> dp(len,0); //gas when arrives station i

for(int i=0; i<len; i++){
int step = 0;
for(int j=i; j<len+i; j++){
int cur = j<len?j:j-len;
int next = j+1<len?j+1:j+1-len;
dp[next] = dp[cur]+gas[cur]-cost[cur];
if(dp[next]<0){
dp[next] = 0;
break;
}
step++;
}
if(step==len) return i;
}
return -1;
}
};

class Solution {
public:
int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
int len = gas.size();
int total = 0, sum =0, start = 0;

for(int i=0; i<len; i++){
total += gas[i]-cost[i];
sum += gas[i]-cost[i];
if(sum<0){
start = i+1;
sum = 0;
}
}

if(total<0) return -1;
else return start;
}
};

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：11759次
• 积分：642
• 等级：
• 排名：千里之外
• 原创：31篇
• 转载：150篇
• 译文：0篇
• 评论：0条
文章分类