FilesExpand file tree

 master

/

GasStation.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

28 lines (27 loc) · 1 KB

 master

/

GasStation.java

Top

File metadata and controls

• Code
• Blame

28 lines (27 loc) · 1 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

/*

Author: Andy, nkuwjg@gmail.com

Date: Jan 3, 2015

Problem: Gas Station

Difficulty: Easy

Source: http://oj.leetcode.com/problems/gas-station/

Notes:

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.

The solution is guaranteed to be unique.

Solution: ...

*/

public class Solution {

public int canCompleteCircuit(int[] gas, int[] cost) {

int N = gas.length;

int res = 0, min = gas[0] - cost[0], sum = min;

for (int i = 1; i < N; ++i) {

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

if (sum < min) {

min = sum;

res = i;

}

}

return sum >= 0 ? (res + 1) % N : -1;

}

}