Leetcode 134. Gas Station

Leetcode 134. Gas Station

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 in the clockwise direction, otherwise return -1.
Note:If there exists a solution, it is guaranteed to be unique.Both input arrays are non-empty and have the same length.Each element in the input arrays is a non-negative integer.

Example 1:
Input:
gas = [1,2,3,4,5]
cost = [3,4,5,1,2]
Output: 3

Example 2:
Input:
gas = [2,3,4]
cost = [3,4,3]
Output: -1

题目大意：
给定每个加油站的加油量和离开它的耗油量，加油站呈环状，初始油量为0，求是否存在一个起点能有充足的油走完一圈。

解题思路：
能走完的一个前提是总加油量大于等于总耗油量，则从第一个位置作为起点开始遍历，在每个加油站完成加油和耗油操作，若出现总加油量小于总耗油量，则说明从当前起点到这个点都不能成为成功走完一圈的起点，因此更新起点为下一个加油站。时间复杂度O(n).

代码：
``
class Solution {
public:
int canCompleteCircuit(vector& gas, vector& cost) {
int len = gas.size(), start = 0, sum = 0, all = 0;
for(int i = 0; i < len; i++)
{
all += gas[i] - cost[i];
sum += gas[i] - cost[i];
if(sum < 0)
{
start = i + 1;
sum = 0;
}
}
return (all >= 0) ? start : -1;
}
};