FilesExpand file tree

 master

/

Solution33.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

40 lines (38 loc) · 1.11 KB

 master

/

Solution33.java

Copy path

Top

File metadata and controls

• Code
• Blame

40 lines (38 loc) · 1.11 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

29

30

31

32

33

34

35

36

37

38

39

40

/*

* 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

* 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 Solution33 {

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

int currentGas = 0;

int len = gas.length;

if (len == 1) return 0;

for (int i = 0; i < len; i++) {

if (gas[i] >= cost[i]) {

currentGas = gas[i] - cost[i];

int j = i + 1;

while (j % len != i && currentGas >= cost[j%len]-gas[j%len]) {

currentGas -= (cost[j%len] - gas[j%len]);

j++;

}

if (j % len == i) return i;

if (j >= len)

return -1;

else

i = j;

}

}

return -1;

}

public static void main(String ...args) {

int[] gas = {1, 2};

int[] cost = {2, 1};

Solution33 s33 = new Solution33();

System.out.println(s33.canCompleteCircuit(gas, cost));

}

}