Leetcode no. 134

最新推荐文章于 2018-01-06 20:35:58 发布

SmithZz

最新推荐文章于 2018-01-06 20:35:58 发布

阅读量291

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/SmithZz/article/details/51931572

版权

leetcode 专栏收录该内容

114 篇文章 0 订阅

订阅专栏

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.

public class Solution {
    public int canCompleteCircuit(int[] gas, int[] cost) {
        if (gas.length==0 || cost.length==0) return -1;
        int total=0, partial_total=0, res=0;
        for (int i=0; i<gas.length; i++){
            total+= gas[i]- cost[i];
            partial_total+= gas[i]-cost[i];
            if (partial_total<0){
                partial_total=0;
                res=i+1;
            }
        }
        return total>=0 ? res : -1;
    }
}