LeetCode 134. Gas Station

题目来源：https://leetcode.com/problems/gas-station/

问题描述

134. Gas Station

Medium

There are N gas stations along a circular route, where the amount of gas at station iis 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 in the clockwise direction, otherwise return -1.

Note:

• If there exists a solution, it is guaranteed to be unique.
• Both input arrays are non-empty and have the same length.
• Each element in the input arrays is a non-negative integer.

Example 1:

Input:

gas  = [1,2,3,4,5]

cost = [3,4,5,1,2]

 

Output: 3

 

Explanation:

Start at station 3 (index 3) and fill up with 4 unit of gas. Your tank = 0 + 4 = 4

Travel to station 4. Your tank = 4 - 1 + 5 = 8

Travel to station 0. Your tank = 8 - 2 + 1 = 7

Travel to station 1. Your tank = 7 - 3 + 2 = 6

Travel to station 2. Your tank = 6 - 4 + 3 = 5

Travel to station 3. The cost is 5. Your gas is just enough to travel back to station 3.

Therefore, return 3 as the starting index.

Example 2:

Input:

gas  = [2,3,4]

cost = [3,4,3]

 

Output: -1

 

Explanation:

You can't start at station 0 or 1, as there is not enough gas to travel to the next station.

Let's start at station 2 and fill up with 4 unit of gas. Your tank = 0 + 4 = 4

Travel to station 0. Your tank = 4 - 3 + 2 = 3

Travel to station 1. Your tank = 3 - 3 + 3 = 3

You cannot travel back to station 2, as it requires 4 unit of gas but you only have 3.

Therefore, you can't travel around the circuit once no matter where you start.

------------------------------------------------------------

题意

给定两个数组gas和cost分别表示环形道路上加油站可以加的油量和相邻两个加油站之间的距离，求加油站的坐标，使得空油箱的汽车从该加油站启程可以环绕道路一周而不会出现因为缺油抛锚在两个加油站之间的情况，如果不存在这样的加油站，则返回-1.

假设汽车的油箱的容量是无限的。并且算例保证如果有可行解，则可行解是唯一的。

------------------------------------------------------------

思路

首先有两个引理：

引理1：A,B,C是顺时针方向排布的三个加油站，如果空油箱的汽车从A可以到达B但无法达到C，则空油箱的汽车从B无法到达C。

引理2：如果sum(gas) >= sum(cost)，则一定有解。

引理1是显然的，引理2用反证法可证（此处证明略）。根据这两个引理，可以得到如下O(n)的算法：

空油箱的汽车从0号加油站开始，遇到加油站则加满油；如果出现无法达到第i个加油站的情况，则将空油箱的汽车的起点重新设置为i+1. 当遍历完所有加油站之后，如果sum(gas) >= sum(cost), 则返回上一个可行的出发点，否则返回-1.

根据引理1和引理2易证该算法的正确性：从i号节点可以达到j之前的节点但无法达到j号节点，则i和j号之间的节点都无法达到j号节点，因此都不能作为起点（由引理1）；如果k号节点可以达到n-1号节点且sum(gas) >= sum(cost)，则必定存在可行解（由引理2），那么k就是唯一的可行解（由题设）。

------------------------------------------------------------

代码

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