[Leetcode]Gas Station

5 篇文章 0 订阅

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.

具体分析可以参考 http://blog.csdn.net/linhuanmars/article/details/22706553

class Solution:
    # @param gas, a list of integers
    # @param cost, a list of integers
    # @return an integer
    def canCompleteCircuit(self, gas, cost):
        if gas is None or len(gas) == 0 or cost is None or len(cost) == 0 or len(gas) != len(cost):
            return -1
        sumVal = total = 0; index = -1
        for i in xrange(len(gas)):
            sumVal += gas[i] - cost[i]
            total += gas[i] - cost[i]
            if sumVal < 0:
                sumVal = 0
                index = i
        return index + 1 if total >= 0 else -1


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值