From b23a26772f8e976d0f0079fbeae254dcf1414d3c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=94=90=E6=A0=91=E6=A3=AE?= <14021051@buaa.edu.cn>
Date: Fri, 12 Oct 2018 23:40:15 +0800
Subject: [PATCH] Create 70. Climbing Stairs.md

---
 70. Climbing Stairs.md | 38 ++++++++++++++++++++++++++++++++++++++
 1 file changed, 38 insertions(+)
 create mode 100644 70. Climbing Stairs.md

diff --git a/70. Climbing Stairs.md b/70. Climbing Stairs.md
new file mode 100644
index 0000000..f522502
--- /dev/null
+++ b/70. Climbing Stairs.md	
@@ -0,0 +1,38 @@
+# [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/description/)
+# 思路
+简单的动态规划。   
+按照最后是跨一步还是两步可以将到达第n步的所有情况分为两种：
+* 1、从第n-2步阶梯一下跨两步到第n步阶梯；
+* 2、从第n-1步阶梯跨一步到第n步阶梯；    
+即若dp[i]代表跨到第i步阶梯的情况数，那么`dp[i] = dp[i - 1] + dp[i - 2]`。  
+时间复杂度和空间复杂度都为O(n)，可将空间复杂度优化为O(1)
+# C++
+```
+class Solution {
+public:
+    int climbStairs(int n) {
+        vector<int>dp(n + 1);
+        dp[0] = 1;
+        dp[1] = 1;
+        for(int i = 2; i <= n;i++){
+            dp[i] = dp[i - 1] + dp[i - 2];
+        }
+        return dp[n];
+    }
+};
+```
+空间优化后的版本:
+```
+class Solution {
+public:
+    int climbStairs(int n) {
+        int tmp, pre = 1, res = 1;
+        for(int i = 2; i <= n;i++){
+            tmp = res;
+            res += pre;
+            pre = tmp;
+        }
+        return res;
+    }
+};
+```