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.
解答方案:
(1)类似于求循环数组中的最大子序列问题
(2)通过从某个起点开始,一旦可以前进,终点即向后移动;否则起点向前移动(中间段无需考虑)