Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
33 lines (32 loc) · 1018 Bytes

File metadata and controls

33 lines (32 loc) · 1018 Bytes
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
package leetcode;
public class leetcode134 {
public static void main(String[] args) {
System.out.println(
new leetcode134().canCompleteCircuit(new int[]{
3,1,1
},new int[]{
1,2,2
})
);
}
public int canCompleteCircuit(int[] gas, int[] cost) {
for (int i = 0; i <gas.length ; i++) {
int allGas=0; //所有的汽油,初始为0
for (int j = i; j <=gas.length ; j++) {
if (j==gas.length){
if (i==0&&allGas>=0) return i;
for (int k = 0; k <i; k++) {
allGas+=gas[k]-cost[k];
if (allGas<0) break;
if (k==i-1&&allGas>=0) return i;
}
}
if (j<gas.length){
allGas+=gas[j]-cost[j];
if (allGas<0) break;
}
}
}
return -1;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.