Commit dbfc891

author

robot

committed

2 parents b632742 + cd1f1a9 commit dbfc891Copy full SHA for dbfc891

File tree

-2

lines changed

-2

lines changed

Lines changed: 6 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -16,7 +16,7 @@ Return the starting gas station's index if you can travel around the circuit onc`
`16`	`16`	`## 参考答案`
`17`	`17`	`1.暴力求解,时间复杂度O(n^2)`
`18`	`18`	`>`
`19`		`-我们可以一次遍历gas,对于每一个gas我们依次遍历后面的gas,计算remian,如果remain一旦小于0,就说明不行,我们继续遍历下一个`
	`19`	`+我们可以一次遍历gas,对于每一个gas我们依次遍历后面的gas,计算remain,如果remain一旦小于0,就说明不行,我们继续遍历下一个`
`20`	`20`	```js
`21`	`21`	`// bad 时间复杂度0(n^2)`
`22`	`22`	`let remain = 0;`
`@@ -74,3 +74,8 @@ return total >= 0? start : -1;`
`74`	`74`	`## 优秀解答`
`75`	`75`
`76`	`76`	`>暂缺`
	`77`	`+`
	`78`	`+`
	`79`	`+`
	`80`	`+`
	`81`	`+`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -30,7 +30,7 @@ Example 3:`
`30`	`30`
`31`	`31`	`Follow up:`
`32`	`32`
`33`		`- Coud you solve it without converting the integer to a string?`
	`33`	`+ Could you solve it without converting the integer to a string?`
`34`	`34`	```
`35`	`35`
`36`	`36`	`## 参考答案`

Comments

(0)