14 课,从三角函数讲到哈希表——每课拆子任务、带手推演算和答案
| 01 三角函数:sin 与 cos | Trigonometric Functions: Sine and Cosine |
| 02 对数与指数 | Logarithms and Exponentials (log2, log10, exp) |
| 03 二维动态规划入门 | Two-dimensional Dynamic Programming |
| 04 最长上升子序列 | Longest Increasing Subsequence (LIS) |
| 05 最长公共子序列 | Longest Common Subsequence (LCS) |
| 06 区间动态规划 | Interval (Range) Dynamic Programming |
| 07 滚动数组 | Rolling Array (Space Optimization for DP) |
| 08 图与邻接矩阵 | Graphs and Adjacency Matrix |
| 09 邻接表 | Adjacency List |
| 10 图的深度优先搜索 | Depth-First Search on Graphs (DFS) |
| 11 图的广度优先搜索 | Breadth-First Search on Graphs (BFS) |
| 12 泛洪算法 | Flood Fill Algorithm |
| 13 哈希表概念 | Hash Table Basics (Hashing, Collision, Chaining) |
| 14 哈希表应用 | Hash Table Applications (unordered_map / unordered_set) |
| 三角函数(正弦/余弦) | Trigonometric Functions (sine / cosine) |
| 弧度 / 角度 | Radian / Degree |
| 单位圆 | Unit Circle |
| 对数 | Logarithm (log) |
| 指数 / 底数 e | Exponential Function; Euler's Number e |
| 换底公式 | Change of Base Formula |
| 状态 / 状态转移 | DP State / State Transition |
| 二维 DP 表 | 2D DP Table |
| 最长上升子序列 | Longest Increasing Subsequence (LIS) |
| 最长公共子序列 | Longest Common Subsequence (LCS) |
| 子串 / 子序列 | Substring / Subsequence |
| 区间 DP | Interval DP (dp[i][j] over [i, j]) |
| 回文 | Palindrome |
| 滚动数组 | Rolling Array |
| 图 / 节点 / 边 | Graph / Vertex (Node) / Edge |
| 有向图 / 无向图 | Directed Graph / Undirected Graph |
| 度(入度/出度) | Degree (In-degree / Out-degree) |
| 邻接矩阵 | Adjacency Matrix |
| 邻接表 | Adjacency List |
| 稠密图 / 稀疏图 | Dense Graph / Sparse Graph |
| 深度优先搜索 | Depth-First Search (DFS) |
| 广度优先搜索 | Breadth-First Search (BFS) |
| visited 数组 | Visited Array |
| 连通块 / 连通分量 | Connected Component |
| 最短路(无权图) | Shortest Path (Unweighted Graph) |
| 泛洪算法 | Flood Fill |
| 哈希函数 | Hash Function |
| 键(key)/ 值(value) | Key / Value |
| 冲突 / 碰撞 | Collision |
| 拉链法 | Separate Chaining |
| 哈希表 / 字典 | Hash Table / Dictionary / Map |