We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4aeb024 commit 132c47fCopy full SHA for 132c47f
Solution/746. Min Cost Climbing Stairs/readme.md
@@ -1,18 +1,13 @@
1
+
2
+# [746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs)
3
4
---
5
comments: true
6
difficulty: Easy
-edit_url: https://github.com/doocs/leetcode/edit/main/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README_EN.md
7
tags:
8
- Array
9
- Dynamic Programming
10
-
-<!-- problem:start -->
11
12
-# [746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs)
13
14
-[中文文档](/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README.md)
15
16
## Description
17
18
<!-- description:start -->
0 commit comments