diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/min_cost_climbing_stairs.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/min_cost_climbing_stairs.cpp')
-rw-r--r-- | other/min_cost_climbing_stairs.cpp | 16 |
1 files changed, 16 insertions, 0 deletions
diff --git a/other/min_cost_climbing_stairs.cpp b/other/min_cost_climbing_stairs.cpp new file mode 100644 index 0000000..3df886a --- /dev/null +++ b/other/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); +} |