diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/min_cost_climbing_stairs.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/min_cost_climbing_stairs.cpp')
-rw-r--r-- | other/min_cost_climbing_stairs.cpp | 16 |
1 files changed, 0 insertions, 16 deletions
diff --git a/other/min_cost_climbing_stairs.cpp b/other/min_cost_climbing_stairs.cpp deleted file mode 100644 index 3df886a..0000000 --- a/other/min_cost_climbing_stairs.cpp +++ /dev/null @@ -1,16 +0,0 @@ -#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); -} |