class Solution {
public:
int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
int len = gas.size();
for (int i = 0; i < len; i++) {
bool flag = true;
int remain = 0;
int start = i;
remain += gas[start % len] - cost[start % len];
if (remain < 0) {
flag = false;
continue;
}
start++;
while (start % len != i) {
remain += gas[start % len] - cost[start % len];
if (remain < 0) {
flag = false;
break;
}
start++;
}
if (flag) return i;
}
return -1;
}
};
LeetCode134.加油站
猜你喜欢
转载自blog.csdn.net/Gentlemanman/article/details/83956187
今日推荐
周排行