###### Middle-题目82：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.

public class Solution {
public int canCompleteCircuit(int[] gas, int[] cost) {
if (gas == null) {
return -1;
}
// Note: The Solution object is instantiated only once and is reused by each test case.
int count = gas.length;

int n = 0;
int gasInCar = 0;
int begin = 0;
int end = 0;
int i = 0;
while (n < count - 1) {
gasInCar += gas[i] - cost[i];
if (gasInCar >=0) {//forward
end++;
i=end;
} else {
begin--;
if (begin < 0) {
begin = count - 1;
}
i = begin;
}

n++;
}

gasInCar += gas[i] - cost[i];

if (gasInCar >= 0) {
return begin;
} else {
return -1;
}

}

}

1ms,beats 5.79%,众数1ms,82.52%
Cmershen的碎碎念：

#### LeetCode（134） Gas Station

2015-11-12 14:00:23

#### [leetcode] 134 Gas Station(经典dp || 贪心)

2015-09-28 14:31:51

#### leetcode134 Gas Station java 算法

2016-07-27 14:30:34

#### [leetcode-134]Gas Station（java）

2015-08-14 13:38:58

#### Gas Station Leetcode Python

2015-01-19 20:31:25

#### 134. Gas Station-贪心算法

2016-03-19 15:13:28

#### [leetcode] 134. Gas Station 解题报告

2016-03-27 04:17:51

#### [LeetCode]134.Gas Station

2014-01-25 10:15:31

#### LeetCode Gas Station 两个特性，两种方法完美解答-更新证明方法

2013-11-03 17:07:40

#### 【LeetCode】Gas Station 解题报告

2014-09-10 09:37:43

## 不良信息举报

Middle-题目82：134. Gas Station