diff --git a/.idea/.gitignore b/.idea/.gitignore
new file mode 100644
index 00000000..35410cac
--- /dev/null
+++ b/.idea/.gitignore
@@ -0,0 +1,8 @@
+# 默认忽略的文件
+/shelf/
+/workspace.xml
+# 基于编辑器的 HTTP 客户端请求
+/httpRequests/
+# Datasource local storage ignored files
+/dataSources/
+/dataSources.local.xml
diff --git a/.idea/leetcode-master.iml b/.idea/leetcode-master.iml
new file mode 100644
index 00000000..5e764c4f
--- /dev/null
+++ b/.idea/leetcode-master.iml
@@ -0,0 +1,9 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="WEB_MODULE" version="4">
+  <component name="Go" enabled="true" />
+  <component name="NewModuleRootManager">
+    <content url="file://$MODULE_DIR$" />
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
\ No newline at end of file
diff --git a/.idea/modules.xml b/.idea/modules.xml
new file mode 100644
index 00000000..7c250acd
--- /dev/null
+++ b/.idea/modules.xml
@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/.idea/leetcode-master.iml" filepath="$PROJECT_DIR$/.idea/leetcode-master.iml" />
+    </modules>
+  </component>
+</project>
\ No newline at end of file
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
new file mode 100644
index 00000000..94a25f7f
--- /dev/null
+++ b/.idea/vcs.xml
@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="$PROJECT_DIR$" vcs="Git" />
+  </component>
+</project>
\ No newline at end of file
diff --git a/problems/0746.使用最小花费爬楼梯.md b/problems/0746.使用最小花费爬楼梯.md
index 44b6406c..d6b3a177 100644
--- a/problems/0746.使用最小花费爬楼梯.md
+++ b/problems/0746.使用最小花费爬楼梯.md
@@ -284,6 +284,33 @@ func min(a, b int) int {
     return b
 }
 ```
+``` GO
+第二种思路: dp[i]表示从i层起跳所需要支付的最小费用
+递推公式:
+i<n :dp[i] = min(dp[i-1],dp[i-2])+cost[i]
+i==n:dp[i] = min(dp[i-1],dp[i-2]) (登顶)
+
+func minCostClimbingStairs(cost []int) int {
+	n := len(cost)
+	dp := make([]int, n+1)
+	dp[0], dp[1] = cost[0], cost[1]
+	for i := 2; i <= n; i++ {
+		if i < n {
+			dp[i] = min(dp[i-1], dp[i-2]) + cost[i]
+		} else {
+			dp[i] = min(dp[i-1], dp[i-2])
+		}
+	}
+	return dp[n]
+}
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
+```
+
 
 ### Javascript 
 ```Javascript