Skip to content

Commit cc0c878

fengxiuyang fengxiuyang

authored

更新 0070.爬楼梯.md Java代码

三种Java代码中有两种是相同的方法,合并相同方法的内容

1 parent 73d7e3f commit cc0c878Copy full SHA for cc0c878

File tree

1 file changed

+14

-23

lines changed

problems
- 0070.爬楼梯.md

1 file changed

+14

-23

lines changed

`‎problems/0070.爬楼梯.md`

Lines changed: 14 additions & 23 deletions

Original file line number	Diff line number	Diff line change
`@@ -213,22 +213,6 @@ public:`
`213`	`213`
`214`	`214`
`215`	`215`	`### Java`
`216`		-```Java
`217`		`-class Solution {`
`218`		`- public int climbStairs(int n) {`
`219`		`- // 跟斐波那契数列一样`
`220`		`- if(n <= 2) return n;`
`221`		`- int a = 1, b = 2, sum = 0;`
`222`		`-`
`223`		`- for(int i = 3; i <= n; i++){`
`224`		`- sum = a + b;`
`225`		`- a = b;`
`226`		`- b = sum;`
`227`		`- }`
`228`		`- return b;`
`229`		`- }`
`230`		`-}`
`231`		-```
`232`	`216`
`233`	`217`	```java
`234`	`218`	`// 常规方式`
`@@ -241,15 +225,22 @@ public int climbStairs(int n) {`
`241`	`225`	`}`
`242`	`226`	`return dp[n];`
`243`	`227`	`}`
	`228`	+```
	`229`	`+`
	`230`	+```Java
`244`	`231`	`// 用变量记录代替数组`
`245`		`-public int climbStairs(int n) {`
`246`		`- int a = 0, b = 1, c = 0; // 默认需要1次`
`247`		`- for (int i = 1; i <= n; i++) {`
`248`		`- c = a + b; // f(i - 1) + f(n - 2)`
`249`		`- a = b; // 记录上一轮的值`
`250`		`- b = c; // 向后步进1个数`
	`232`	`+class Solution {`
	`233`	`+ public int climbStairs(int n) {`
	`234`	`+ if(n <= 2) return n;`
	`235`	`+ int a = 1, b = 2, sum = 0;`
	`236`	`+`
	`237`	`+ for(int i = 3; i <= n; i++){`
	`238`	`+ sum = a + b; // f(i - 1) + f(i - 2)`
	`239`	`+ a = b; // 记录f(i - 1),即下一轮的f(i - 2)`
	`240`	`+ b = sum; // 记录f(i),即下一轮的f(i - 1)`
	`241`	`+ }`
	`242`	`+ return b;`
`251`	`243`	`}`
`252`		`- return c;`
`253`	`244`	`}`
`254`	`245`	```
`255`	`246`

0 commit comments

Comments

(0)