| ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
|---|---|---|---|---|
| 18120 | 18120 算法2-2:有序线性表的有序合并 | 0 / 0 | (None) | |
| 18131 | 18131 算法2-23:一元多项式加法 | 0 / 0 | (None) | |
| 18639 | 18639 算法4-5:求子串位置的定位函数 | 0 / 0 | (None) | |
| 18650 | 18650 算法4-7:KMP算法中的模式串移动数组 | 0 / 0 | (None) | |
| 18661 | 18661 算法4-6:KMP字符串模式匹配算法实现 | 0 / 0 | (None) | |
| 18672 | 18672 算法5-1:稀疏矩阵转置 | 0 / 0 | (None) | |
| 18695 | 18695 算法6-1~6-4:二叉链表存储的二叉树 | 0 / 0 | (None) | |
| 18706 | 18706 算法6-5~6-7:线索二叉树 | 0 / 0 | (None) | |
| 18717 | 18717 算法6-8~6-11:用树表示的等价问题 | 0 / 0 | (None) | |
| 18728 | 18728 算法6-12:自底向上的赫夫曼编码 | 0 / 0 | (None) | |
| 18738 | 18738 算法6-13:自顶向下的赫夫曼编码 | 0 / 0 | (None) | |
| 18749 | 18749 算法7-4,7-5:图的遍历——深度优先搜索 | 0 / 0 | (None) | |
| 18760 | 18760 算法7-6:图的遍历——广度优先搜索 | 0 / 0 | (None) | |
| 18771 | 18771 算法7-7,7-8:无向图的连通分量和生成树 | 0 / 0 | (None) | |
| 18782 | 18782 算法7-9:最小生成树 | 0 / 0 | (None) | |
| 18794 | 18794 算法7-10,7-11:关节点和重连通分量 | 0 / 0 | (None) | |
| 18805 | 18805 算法7-12:有向无环图的拓扑排序 | 0 / 0 | (None) | |
| 18816 | 18816 算法7-15:迪杰斯特拉最短路径算法 | 0 / 0 | (None) | |
| 18819 | 18819 算法9-5~9-8:二叉排序树的基本操作 | 0 / 0 | (None) | |
| 18829 | 18829 算法9-9~9-12:平衡二叉树的基本操作 | 0 / 0 | (None) | |
| 18839 | 18839 算法10-1:直接插入排序 | 0 / 0 | (None) | |
| 18846 | 18846 算法10-2:折半插入排序 | 0 / 0 | (None) | |
| 18855 | 18855 算法10-4,10-5:希尔排序 | 0 / 0 | (None) | |
| 18867 | 18867 算法10-9:简单选择排序 | 0 / 0 | (None) | |
| 18970 | 18970 统计字符 | 0 / 0 | (None) | |
| 19003 | 19003 字符串的反码 | 0 / 0 | (None) | |
| 19014 | 19014 首字母大写 | 0 / 0 | (None) | |
| 19027 | 19027 回文字符串 | 0 / 0 | (None) | |
| 19048 | 19048 字符串的查找删除 | 0 / 0 | (None) | |
| 19099 | 19099 剩下的树 | 0 / 0 | (None) | |
| 19675 | 19675 二叉树 | 0 / 0 | (None) | |
| 19678 | 19678 连通图 | 0 / 0 | (None) | |
| 19679 | 19679 二叉树遍历2 | 0 / 0 | (None) | |
| 19683 | 19683 树查找 | 0 / 0 | (None) | |
| 19687 | 19687 二叉排序树 | 0 / 0 | (None) | |
| 19688 | 19688 二叉搜索树 | 0 / 0 | (None) | |
| 19691 | 19691 排序 | 0 / 0 | (None) | |
| 19714 | 19714 畅通工程1 | 0 / 0 | (None) | |
| 19716 | 19716 畅通工程2 | 0 / 0 | (None) | |
| 19730 | 19730 计算两个矩阵的乘积 | 0 / 0 | (None) | |
| 19731 | 19731 字符串链接 | 0 / 0 | (None) | |
| 19741 | 19741 字符串处理 | 0 / 0 | (None) | |
| 19750 | 19750 反序字符串 | 0 / 0 | (None) | |
| 19753 | 19753 成绩排序2 | 0 / 0 | (None) | |
| 19761 | 19761 字符排序 | 0 / 0 | (None) | |
| 19763 | 19763 成绩排序3 | 0 / 0 | (None) | |
| 19765 | 19765 矩阵转置0 | 0 / 0 | (None) | |
| 19769 | 19769 二叉树遍历1 | 0 / 0 | (None) | |
| 19782 | 19782 比较字符串 | 0 / 0 | (None) | |
| 19796 | 19796 数组排序 | 0 / 0 | (None) | |
| 19813 | 19813 字符串排序 | 0 / 0 | (None) | |
| 19819 | 19819 姓名排序 | 0 / 0 | (None) | |
| 19838 | 19838 整数奇偶排序 | 0 / 0 | (None) | |
| 19959 | 19959 迷宫问题 | 0 / 0 | (None) |
By signing up a 算道OJ universal account, you can submit code and join discussions in all online judging services provided by us.