问题:
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.
解法:
一条路径:x1,x2,......,Xi 若到Xi不可行,则X1,X2,...Xi都不适合做开端。因此O(N)循环一遍遍可以找出哪个站点适合做开端。