mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-11 04:54:51 +08:00
添加 0746.使用最小花费爬楼梯.md Rust版本
添加 0746.使用最小花费爬楼梯.md Rust版本
This commit is contained in:
@ -288,6 +288,24 @@ function minCostClimbingStairs(cost: number[]): number {
|
|||||||
};
|
};
|
||||||
```
|
```
|
||||||
|
|
||||||
|
### Rust
|
||||||
|
|
||||||
|
```Rust
|
||||||
|
use std::cmp::min;
|
||||||
|
impl Solution {
|
||||||
|
pub fn min_cost_climbing_stairs(cost: Vec<i32>) -> i32 {
|
||||||
|
let len = cost.len();
|
||||||
|
let mut dp = vec![0; len];
|
||||||
|
dp[0] = cost[0];
|
||||||
|
dp[1] = cost[1];
|
||||||
|
for i in 2..len {
|
||||||
|
dp[i] = min(dp[i-1], dp[i-2]) + cost[i];
|
||||||
|
}
|
||||||
|
min(dp[len-1], dp[len-2])
|
||||||
|
}
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
### C
|
### C
|
||||||
|
|
||||||
```c
|
```c
|
||||||
|
Reference in New Issue
Block a user