LeetCode134.加油站
阿新 • • 發佈:2018-11-24
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; } };