leetcode简单题27 N.119 杨辉三角II rust描述

最新推荐文章于 2024-10-19 16:37:08 发布

独好紫罗兰

最新推荐文章于 2024-10-19 16:37:08 发布

阅读量545

点赞数 8

分类专栏： rust-leetcode简单题文章标签： leetcode rust 算法

本文链接：https://blog.csdn.net/BECOMEviolet/article/details/140508652

版权

rust-leetcode简单题专栏收录该内容

27 篇文章 0 订阅

订阅专栏

// 直接生成杨辉三角当前行
pub fn get_row(row_index: i32) -> Vec<i32> {
    let mut row = vec![1; (row_index + 1) as usize];

    for i in 1..=row_index as usize {
        for j in (1..i).rev() {
            row[j] = row[j] + row[j - 1];
        }
    }

    row
}
// 空间优化的方法
pub fn get_row2(row_index: i32) -> Vec<i32> {
    let mut row = vec![1; (row_index + 1) as usize];

    for i in 1..=row_index as usize {
        for j in (1..i).rev() {
            row[j] = row[j] + row[j - 1];
        }
    }

    row
}
// 数学组合数公式
pub fn get_row3(row_index: i32) -> Vec<i32> {
    let mut row = vec![1; (row_index + 1) as usize];

    for k in 1..=row_index as usize {
        row[k] = (row[k - 1] as u64 * (row_index - k as i32 + 1) as u64 / k as u64) as i32;
    }

    row
}
fn main() {}