LeetCode - Gas Station
2014-09-14 16:35
465 查看
题意
判断从哪个加油站开始可以走一圈。
思路
一开始偷懒,直接再赋值一遍,这样就不用处理到头的情况了,MLE。不过只用一个变量来记录就行,如果超出了就让它等于0,意思就从第一个开始。
走过的加油站的数量专门由k来统计。
代码
class Solution {
public:
int canCompleteCircuit(vector<int> &gas, vector<int> &cost)
{
int len = gas.size(), k;
for (int i = 0; i < gas.size(); i++) //枚举起点
{
int rem = 0, cnt = i;
for (k = 0; k < len; k++)
{
if (cnt + k == len) cnt = -k;
rem += gas[cnt + k];
if (rem < cost[cnt + k]) break;
rem -= cost[cnt + k];
}
if (k == len) return i;
}
return -1;
}
};
相关文章推荐
- leetcode——134——Gas Station
- Leetcode:Gas Station
- [LeetCode] Gas Station
- leetcode 134: Gas Station
- [LeetCode] 774. Minimize Max Distance to Gas Station 最小化加油站间的最大距离
- LeetCode 774. Minimize Max Distance to Gas Station
- 【LeetCode】Gas Station
- 【LeetCode】Gas Station 解题报告
- leetcode:Gas Station
- Leetcode | Gas Station
- Gas Station——Leetcode系列(十六)
- leetcode——Gas Station
- leetcode之Gas Station
- LeetCode 134. Gas Station(加油站)
- leetcode gasstation
- LeetCode-Gas Station-加油站-最大子串算法应用
- leetcode之Gas Station
- leetcode Gas Station
- [LeetCode] - Gas Station
- 【LeetCode-面试算法经典-Java实现】【134-Gas Station(加油站问题)】