134. Gas Station

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, otherwise return -1.

Note:
The solution is guaranteed to be unique.

转载于点击打开链接  和点击打开链接

它的思想是，将gas的最后一个视为start，gas的第一个视为end，直至start==end，说明已经遍历了所有的gas。在这一过程中，如所有已遍历站的gas[i]-cost[i]的和小于0,说明从这个start遍历最多只能到此时的end，不能到结尾。所以，start在往前移动一位，在判断此时能否有和大于等于0，判断这个新的起点是否可行。直至遍历到start==end时，如果所有的和大于等于0，说明这个起点可行。

int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {

       int start = gas.size()-1;
       int end = 0;
       int sum = gas[start] - cost[start];
       while (start > end) {
          if (sum >= 0) {
             sum += gas[end] - cost[end];
             ++end;
          }
          else {
             --start;
             sum += gas[start] - cost[start];
          }
       }
       return sum >= 0 ? start : -1;
    }