main.rs

#[path = "./0_数组/mod.rs"]
pub mod array;

#[path = "./0_字符串/mod.rs"]
pub mod string_basic;

#[path = "./1_stack/mod.rs"]
pub mod stack;

#[path = "./2_queue/mod.rs"]
pub mod queue;

#[path = "./3_linkedList/mod.rs"]
pub mod linked_list;

#[path = "./4_set/mod.rs"]
pub mod set;

#[path = "./5_map/mod.rs"]
pub mod map;

#[path = "./6_tree/mod.rs"]
pub mod tree;

#[path = "./7_graph/mod.rs"]
pub mod graph;

#[path = "./8_heap/mod.rs"]
pub mod heap;

#[path = "./9_排序和搜索/mod.rs"]
pub mod sort;

#[path = "./10_分治法/mod.rs"]
pub mod divide_and_conquer;

#[path = "./11_动态规划/mod.rs"]
pub mod dp;

#[path = "./12_贪心算法/mod.rs"]
pub mod greedy;

#[path = "./13_回溯算法/mod.rs"]
pub mod backtracking;

#[path = "./14_并查集/mod.rs"]
pub mod union_find;

#[path = "./15_双指针/mod.rs"]
pub mod two_pointers;

#[path = "./16_滑动窗口/mod.rs"]
pub mod sliding_window;

#[path = "./17_模式匹配/mod.rs"]
pub mod string;

#[path = "./18_哈希/mod.rs"]
pub mod hashing;

#[path = "./19_数学/mod.rs"]
pub mod math;

#[path = "./20_杂题/mod.rs"]
pub mod misc_problems;

#[path = "./21_位运算/mod.rs"]
pub mod bit_manipulation;

#[path = "./22_专题/mod.rs"]
pub mod special_topics;

#[path = "./23_设计类/mod.rs"]
pub mod design;

#[path = "./24_高级数据结构/mod.rs"]
pub mod advanced_data_structures;

#[path = "./25_多项式/mod.rs"]
pub mod polynomial;

#[path = "./26_misc/mod.rs"]
pub mod misc;

pub mod atcoder;
pub mod chore;
pub mod leetcode;

// !use dependency instead of mod.
// #[path = "./rust/rust-algo-lib/templates/src/lib.rs"]

#[path = "./rust/mod.rs"]
pub mod rust;

/// Root.
fn main() {
    println!("111")
}