mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2026-02-02 18:39:09 +08:00
更新代码块
This commit is contained in:
@@ -51,7 +51,7 @@ dp[0]其实就是一个无意义的存在,不用去初始化dp[0]。
|
||||
|
||||
一个严谨的思考过程,应该是初始化dp[1] = 1,dp[2] = 2,然后i从3开始遍历,代码如下:
|
||||
|
||||
```C++
|
||||
```CPP
|
||||
dp[1] = 1;
|
||||
dp[2] = 2;
|
||||
for (int i = 3; i <= n; i++) { // 注意i是从3开始的
|
||||
@@ -67,7 +67,7 @@ for (int i = 3; i <= n; i++) { // 注意i是从3开始的
|
||||
|
||||
这里我先给出我的实现代码:
|
||||
|
||||
```C++
|
||||
```CPP
|
||||
class Solution {
|
||||
public:
|
||||
int climbStairs(int n) {
|
||||
@@ -122,7 +122,7 @@ public:
|
||||
|
||||
所以代码也可以这么写:
|
||||
|
||||
```C++
|
||||
```CPP
|
||||
class Solution {
|
||||
public:
|
||||
int minCostClimbingStairs(vector<int>& cost) {
|
||||
|
||||
Reference in New Issue
Block a user