Loading docs/ds/index.md +38 −38 Original line number Diff line number Diff line Loading @@ -2,76 +2,76 @@ 这里收集了一些数据结构的内简介。 [x] STL * [x] STL [x] STL 简介 * [x] STL 简介 [x] vector * [x] vector [x] priority_queue * [x] priority_queue [x] map * [x] map [x] bitset * [x] bitset [x] 栈 * [x]栈 [x] 队列 * [x]队列 [x] pb_ds * [x] pb_ds [x] pb_ds 简介 * [x] pb_ds 简介 [x] __gnu_pbds::priority_queue * [x] __gnu_pbds::priority_queue [x] 链表 * [x] 链表 [x] 哈希表 * [x] 哈希表 [x] 并查集 * [x] 并查集 [x] 堆 * [x] 堆 [x] 堆简介 * [x]堆简介 [x] 二叉堆 * [x]二叉堆 [x] 配对堆 * [x]配对堆 [x] 块状数据结构 * [x] 块状数据结构 [x] 分块思想 * [x]分块思想 [x] 块状链表 * [x]块状链表 [x] 块状数组 * [x]块状数组 [x] 树分块 * [x]树分块 [x] 单调栈 * [x] 单调栈 [x] 单调队列 * [x] 单调队列 [x] 倍增 * [x] 倍增 [x] 树状数组 * [x] 树状数组 [x] 线段树 * [x] 线段树 [x] 划分树 * [x] 划分树 [x] 虚树 * [x] 虚树 [x] 平衡树 * [x] 平衡树 [x] 树套树 * [x] 树套树 [x] K-Dtree * [x] K-Dtree [x] 可持久化数据结构 * [x] 可持久化数据结构 [x] 珂朵莉树 * [x] 珂朵莉树 [x] Link Cut Tree * [x] Link Cut Tree [x] Euler Tour Tree * [x] Euler Tour Tree Loading
docs/ds/index.md +38 −38 Original line number Diff line number Diff line Loading @@ -2,76 +2,76 @@ 这里收集了一些数据结构的内简介。 [x] STL * [x] STL [x] STL 简介 * [x] STL 简介 [x] vector * [x] vector [x] priority_queue * [x] priority_queue [x] map * [x] map [x] bitset * [x] bitset [x] 栈 * [x]栈 [x] 队列 * [x]队列 [x] pb_ds * [x] pb_ds [x] pb_ds 简介 * [x] pb_ds 简介 [x] __gnu_pbds::priority_queue * [x] __gnu_pbds::priority_queue [x] 链表 * [x] 链表 [x] 哈希表 * [x] 哈希表 [x] 并查集 * [x] 并查集 [x] 堆 * [x] 堆 [x] 堆简介 * [x]堆简介 [x] 二叉堆 * [x]二叉堆 [x] 配对堆 * [x]配对堆 [x] 块状数据结构 * [x] 块状数据结构 [x] 分块思想 * [x]分块思想 [x] 块状链表 * [x]块状链表 [x] 块状数组 * [x]块状数组 [x] 树分块 * [x]树分块 [x] 单调栈 * [x] 单调栈 [x] 单调队列 * [x] 单调队列 [x] 倍增 * [x] 倍增 [x] 树状数组 * [x] 树状数组 [x] 线段树 * [x] 线段树 [x] 划分树 * [x] 划分树 [x] 虚树 * [x] 虚树 [x] 平衡树 * [x] 平衡树 [x] 树套树 * [x] 树套树 [x] K-Dtree * [x] K-Dtree [x] 可持久化数据结构 * [x] 可持久化数据结构 [x] 珂朵莉树 * [x] 珂朵莉树 [x] Link Cut Tree * [x] Link Cut Tree [x] Euler Tour Tree * [x] Euler Tour Tree