Gas Station——Leetcode系列（十六）

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.

Analysis:

First, iterate from station 0 to station length -1, if gas < cost, then start from index + 1 to index (circle) ; we use flag to avoid starting station 0 again.  If there is no solution from ascending, then we start station length -1 to station 0 reversely, by the same method.

Solution:

public class Solution {
    public int canCompleteCircuit(int[] gas, int[] cost) {
        int length = gas.length;
        boolean flag = false;
        for(int i = 0; i < length; i++){
           int index = i;
           int remain = 0;
           while(true){
               if(remain + gas[index] >= cost[index]){
                   remain += gas[index] - cost[index];
                   index++;
               }else{
                   i = index;
                   break;
               }
               if(index == length){
                   index = 0;
                   flag = true;
               }
               if(index == i){
                   return index;
               }
           }
           if(flag){
               break;
           }
        }
        flag = false;
        for(int i = length - 1; i >= 0; i--){
            int index = i;
            int remain = 0;
            while(true){
                if(remain + gas[index] >= cost[(index - 1 + length) % length]){
                    remain += gas[index] - cost[(index - 1 + length) % length];
                    index--;
                }else{
                    i = index;
                    break;
                }
                if(index == -1){
                    index = length - 1;
                    flag = true;
                }
                if(index == i){
                    return index;
                }
            }
            if(flag){
                break;
            }
        }
        return -1;
    }
}

题目来源：https://oj.leetcode.com/problems/gas-station/