xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-26 02:36:28 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

🐳 chore(computational_complexity): temporary remove space_time,rs

Browse source
This commit is contained in:
xblakicex 2023-01-15 19:01:06 +01:00
parent 16e4af08b6
commit 3d4469203b
1 changed files with 0 additions and 73 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

73
codes/rust/chapter_computational_complexity/space_complexity.rs
View file

@ -1,73 +0,0 @@
/**
* File: space_complexity.rs
* Created Time: 2023-01-13
* Author: xBLACICEx (xBLACKICEx@outlook.com)
*/
#[allow(unused_variables)]
use std::collections::HashMap;
/* 函数 */
fn func() {
// do something
}
/* 常数阶 */
fn constant(n: i32) {
// TODO
}
/* 线性阶 */
fn linear(n: i32) {
// 长度为 n 的数组占用 O(n) 空间
let nums = vec![0; n as usize];
// 长度为 n 的列表占用 O(n) 空间
// TODO
// 长度为 n 的哈希表占用 O(n) 空间
let map: HashMap<_, _> = (0..n).map(|i| (i, format!("{}", i))).collect();
}
/* 线性阶（递归实现） */
fn linear_recur(n: i32) {
println!("递归 n = {n}");
if n == 1 {
return;
}
linear_recur(n - 1);
}
/* 平方阶 */
fn quadratic(n: i32) {
// 二维列表占用 O(n^2) 空间
let num_matrix = vec![vec![0; n as usize]; n as usize];
}
/* 平方阶（递归实现） */
fn quadratic_recur(n: i32) -> i32 {
if n <= 0 {
return 0
}
// 数组 nums 长度为 n, n-1, ..., 2, 1
let nums = vec![0; n as usize];
println!("递归 n = {n} 中的 nums 长度 = {}", nums.len());
return quadratic_recur(n - 1);
}
fn build_tree(n: usize) {
// TODO
}
fn main() {
let n = 5;
/* 常数阶 */
constant(n);
/* 线性阶 */
linear(n);
linear_recur(n);
/* 平方阶 */
quadratic(n);
quadratic_recur(n);
/* 指数阶 */
// let root = build_tree(n);
// print_tree(root);
}