Leetcode:Gas Station

最新推荐文章于 2020-05-24 10:07:09 发布

zhumingyuan111

最新推荐文章于 2020-05-24 10:07:09 发布

阅读量289

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/zhumingyuan111/article/details/78726742

版权

Leetcode 专栏收录该内容

63 篇文章 0 订阅

订阅专栏

URL

https://leetcode.com/problems/gas-station/description/

描述

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.

代码

class Solution {
    public int canCompleteCircuit(int[] gas, int[] cost) {
        int len = gas.length;
        int[] diff = new int[len];
        for(int i=0;i<len;i++){
            diff[i] = gas[i] - cost[i];
        }
        int sum = diff[0];
        int begin = 0,end = 0;
        for(int i=1;i<len;i++){
            if(sum>=0){
                end++;
                sum+=diff[end];
            }else {
                begin--;
                if(begin<0) begin+=len;
                sum+=diff[begin];
            }
        }
        return sum<0?-1:begin;
    }
}