题解 | #最小花费爬楼梯# | Rust

struct Solution{

}

impl Solution {
    fn new() -> Self {
        Solution{}
    }

    /**
    * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
    *
    * 
        * @param cost int整型一维数组 
        * @return int整型
    */
    pub fn minCostClimbingStairs(&self, cost: Vec<i32>) -> i32 {
        let (mut two, mut one) = (0, 0);
        for (_,val) in cost.iter().enumerate() {
            let cur_cost = std::cmp::min(two, one);
            two = one;
            one = cur_cost + val;
        }
        return std::cmp::min(two, one);
    }
}