zoukankan      html  css  js  c++  java
  • [leetcode]Gas Station @ Python

    原题地址:https://oj.leetcode.com/problems/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.

    解题思路:这道题也很tricky,自己想是很难想出来的。如果sum(gas)<sum(cost)的话,那么一定无解。saving是走完一站邮箱剩下的油,如果加上gas[i]也到不了下一站,那么继续将下一站设置为起点,然后再检查,是不是很巧妙呢?

    代码:时间复杂度O(n),空间复杂度O(1)

    class Solution:
        # @param gas, a list of integers
        # @param cost, a list of integers
        # @return an integer
        def canCompleteCircuit(self, gas, cost):
            if sum(gas) < sum(cost): return -1
            startIndex = 0
            saving = 0
            for i in range(len(gas)):
                if gas[i] + saving < cost[i]: 
                    startIndex = i + 1
                    saving = 0
                else:
                    saving += gas[i] - cost[i]
            return startIndex
  • 相关阅读:
    vmware-tools安装
    UBUNTU 安装教程
    CANO入门(三)
    CANOE入门(二)
    CANOE入门(一)
    ubuntu 常见错误--Could not get lock /var/lib/dpkg/lock
    vmware-tools安装
    root权限
    ARM嵌入式开发中的GCC内联汇编__asm__
    OpenCV3.1.0+VS2015开发环境配置
  • 原文地址:https://www.cnblogs.com/asrman/p/3970753.html
Copyright © 2011-2022 走看看