From 518b48dbb407b706dc4a0296bf8b3621e52fdf27 Mon Sep 17 00:00:00 2001
From: Guanzhong Pan <gpan20020205@gmail.com>
Date: Wed, 12 Jan 2022 16:19:37 +0000
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200746.=E4=BD=BF=E7=94=A8?=
 =?UTF-8?q?=E6=9C=80=E5=B0=8F=E8=8A=B1=E8=B4=B9=E7=88=AC=E6=A5=BC=E6=A2=AF?=
 =?UTF-8?q?.md=20C=E8=AF=AD=E8=A8=80=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0746.使用最小花费爬楼梯.md | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)

diff --git a/problems/0746.使用最小花费爬楼梯.md b/problems/0746.使用最小花费爬楼梯.md
index a146cc8b..91cd2c8b 100644
--- a/problems/0746.使用最小花费爬楼梯.md
+++ b/problems/0746.使用最小花费爬楼梯.md
@@ -266,5 +266,21 @@ var minCostClimbingStairs = function(cost) {
 };
 ```
 
+### C
+```c
+int minCostClimbingStairs(int* cost, int costSize){
+    //开辟dp数组，大小为costSize
+    int *dp = (int *)malloc(sizeof(int) * costSize);
+    //初始化dp[0] = cost[0], dp[1] = cost[1]
+    dp[0] = cost[0], dp[1] = cost[1];
+
+    int i;
+    for(i = 2; i < costSize; ++i) {
+        dp[i] = (dp[i-1] < dp[i-2] ? dp[i-1] : dp[i-2]) + cost[i];
+    }
+    //选出倒数2层楼梯中较小的
+    return dp[i-1] < dp[i-2] ? dp[i-1] : dp[i-2];
+}
+```
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>