Sep 9, 2022 · Sep 6, 2022 · Sep 6, 2022 · Sep 9, 2022 · Sep 9, 2022
diff --git a/problems/0070.爬楼梯.md b/problems/0070.爬楼梯.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -213,22 +213,6 @@ public:


		### Java
	```Java
	class Solution {
	public int climbStairs(int n) {
	// 跟斐波那契数列一样
	if(n <= 2) return n;
	int a = 1, b = 2, sum = 0;

	for(int i = 3; i <= n; i++){
	sum = a + b;
	a = b;
	b = sum;
	}
	return b;
	}
	}
	```

		```java
		// 常规方式
Expand All		@@ -241,15 +225,22 @@ public int climbStairs(int n) {
		}
		return dp[n];
		}
	```

	```Java
		// 用变量记录代替数组
	public int climbStairs(int n) {
	int a = 0, b = 1, c = 0; // 默认需要1次
	for (int i = 1; i <= n; i++) {
	c = a + b; // f(i - 1) + f(n - 2)
	a = b; // 记录上一轮的值
	b = c; // 向后步进1个数
	class Solution {
	public int climbStairs(int n) {
	if(n <= 2) return n;
	int a = 1, b = 2, sum = 0;

	for(int i = 3; i <= n; i++){
	sum = a + b; // f(i - 1) + f(i - 2)
	a = b; // 记录f(i - 1),即下一轮的f(i - 2)
	b = sum; // 记录f(i),即下一轮的f(i - 1)
	}
	return b;
		}
	return c;
		}
		```

Expand Down