134134134

134

class Solution {
    int res = 0;
    int begin;
    boolean flag = false;
    public int canCompleteCircuit(int[] gas, int[] cost) {
        for(int startIndex = 0; startIndex < gas.length; startIndex++){
            begin = startIndex;
            dfs(gas, cost, startIndex, 0, 0);
            if(flag) break;
        }
        return res;
    }
    public void dfs(int[] gas, int[] cost, int startIndex, int contain, int loop){
        startIndex = startIndex%gas.length;
        if((gas[startIndex] == 0 && contain == 0) || loop > gas.length || contain < 0) {
            res = -1;
            return;
        }
        if(loop == gas.length && contain >= 0){
            res = begin;
            flag = true;
            return;
        }
        dfs(gas, cost, startIndex + 1, contain + gas[startIndex] - cost[startIndex], loop + 1);
    }
}