diff options
author | jack <[email protected]> | 2024-06-14 13:13:15 -0600 |
---|---|---|
committer | jack <[email protected]> | 2024-06-14 13:13:15 -0600 |
commit | d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa (patch) | |
tree | 96df922dae2a5073d9a50ea70c7aae6aa37e3ebe /min_cost_climbing_stairs.cpp | |
download | leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.tar.gz leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.zip |
initial
Diffstat (limited to 'min_cost_climbing_stairs.cpp')
-rw-r--r-- | min_cost_climbing_stairs.cpp | 16 |
1 files changed, 16 insertions, 0 deletions
diff --git a/min_cost_climbing_stairs.cpp b/min_cost_climbing_stairs.cpp new file mode 100644 index 0000000..3df886a --- /dev/null +++ b/min_cost_climbing_stairs.cpp @@ -0,0 +1,16 @@ +#include "leetcode.h" + +class Solution { +public: + int minCostClimbingStairs(vector<int> &cost) { + for (int i = cost.size() - 3; ~i; i--) + cost[i] += min(cost[i + 1], cost[i + 2]); + return min(cost[0], cost[1]); + } +}; + +int main() { + Solution obj; + vector<int> cost = {10, 15, 20}; + cout << obj.minCostClimbingStairs(cost); +} |