gas-station

https://www.nowcoder.com/practice/3b1abd8ba2e54452b6e18b31780b3635?tpId=46&tqId=29046&tPage=1&rp=1&ru=/ta/leetcode&qru=/ta/leetcode/question-ranking

题目描述

 

There are N gas stations along a circular route, where the amount of gas at station iisgas[i].

You have a car with an unlimited gas tank and it costscost[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.

 

 

我的解法就low了：

public class Solution {
    public int canCompleteCircuit(int[] gas, int[] cost) {
        
        Boolean isCan = false;
        for(int i=0;i<gas.length;i++){//作为起点
            Boolean isStart = true;
            int tank=0;//初始油量，当前油量
            for(int j=0;j<gas.length;j++){
                if(i+j<gas.length){
                    if(tank+gas[i+j]-cost[i+j]>=0){
                        tank=tank+gas[i+j]-cost[i+j];
                        continue;
                    }else{
                        isStart=false;
                        break;
                    }
                }
                if(i+j>=gas.length){
                    if(tank+gas[i+j-gas.length]-cost[i+j-gas.length]>=0){
                        tank=tank+gas[i+j-gas.length]-cost[i+j-gas.length];
                        continue;
                    }else{
                        isStart=false;
                        break;
                    }
                }
            }
            if(isStart==true){
                return i;
            }
        }
        if(isCan==false){
            return -1;
        }
        return 0;
    }
}