<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[书香水墨]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_27870421</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_27870421]]></copyright><item><title><![CDATA[OpenSpec + Superpowers 协同开发指南]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/161986078</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/161986078</guid><author>qq_27870421</author><pubDate>Mon, 15 Jun 2026 00:24:57 +0800</pubDate><description><![CDATA[一套从技术预研到代码归档的完整 AI 辅助开发方法论。]]></description><category></category></item><item><title><![CDATA[openspec与superpowers配合使用示例]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/161937002</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/161937002</guid><author>qq_27870421</author><pubDate>Fri, 12 Jun 2026 23:54:37 +0800</pubDate><description><![CDATA[OpenSpec 管底层技术约束：统一架构、中间件、存储规范，防止开发随意选技术方案Superpowers 管上层业务交付：标准化需求梳理、编码任务拆分、强制设计确认强约束联动：Superpowers 自动读取 Spec，业务设计、编码、评审全程受技术规范限制，架构不跑偏完整追溯链路：从前期技术调研 → 架构规范 → 业务设计 → 代码 → 归档，全流程可复盘。]]></description><category></category></item><item><title><![CDATA[OpenSpec 与 Superpowers]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/161903671</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/161903671</guid><author>qq_27870421</author><pubDate>Thu, 11 Jun 2026 22:52:50 +0800</pubDate><description><![CDATA[OpenSpec想清楚（做什么、为什么、验收标准）。做正确（先测试、再编码、必审查）。组合价值：让 AI 编程从“能跑就行”升级为工业级可维护代码。]]></description><category></category></item><item><title><![CDATA[栈（Stack）核心概念]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159615153</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159615153</guid><author>qq_27870421</author><pubDate>Sun, 29 Mar 2026 17:14:46 +0800</pubDate><description><![CDATA[栈是一种**后进先出（LIFO - Last In First Out）**的线性数据结构。想象一摞盘子，你只能从顶部放盘子，也只能从顶部取盘子。实现方式优点缺点适用场景数组实现访问快，内存局部性好固定容量，可能溢出已知最大容量链表实现动态扩容，无容量限制额外指针开销容量不确定ArrayDeque高效、官方推荐、无锁无首选方案栈是最基础且重要的数据结构之一，掌握它的原理和实现对于理解递归、算法设计都至关重要！]]></description><category></category></item><item><title><![CDATA[摩尔投票法（Boyer-Moore Voting Algorithm）]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159438784</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159438784</guid><author>qq_27870421</author><pubDate>Wed, 25 Mar 2026 00:08:19 +0800</pubDate><description><![CDATA[摩尔投票法（Boyer-Moore Voting Algorithm）是一种内找到数组中多数元素（出现次数超过 ⌊n/2⌋ 的元素）的巧妙算法。]]></description><category></category></item><item><title><![CDATA[阻塞队列 BlockingQueue]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159356597</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159356597</guid><author>qq_27870421</author><pubDate>Sun, 22 Mar 2026 22:45:25 +0800</pubDate><description><![CDATA[是 Java 并发包（）中的核心接口，它继承自Queue，支持在队列满时阻塞插入操作、在队列空时阻塞移除操作。它是实现生产者-消费者模式的标准工具。]]></description><category></category></item><item><title><![CDATA[杨辉三角（Pascal‘s Triangle）]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159356054</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159356054</guid><author>qq_27870421</author><pubDate>Sun, 22 Mar 2026 22:08:21 +0800</pubDate><description><![CDATA[杨辉三角（Pascal’s Triangle）这是一个在数学中非常经典的数字三角形，具有许多有趣的性质和应用。是一个由数字组成的三角形阵列，其中每个数等于它上方两数之和。它的历史可以追溯到中国古代数学家杨辉（约1238-1298年），因此在中国被称为"杨辉三角"；在西方则因法国数学家帕斯卡（Blaise Pascal）的研究而被称为"帕斯卡三角形"。]]></description><category></category></item><item><title><![CDATA[快速排序（Quick Sort）]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159354449</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159354449</guid><author>qq_27870421</author><pubDate>Sun, 22 Mar 2026 19:39:00 +0800</pubDate><description><![CDATA[快速排序（Quick Sort）是一种。]]></description><category></category></item><item><title><![CDATA[归并排序（Merge Sort）]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159353461</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159353461</guid><author>qq_27870421</author><pubDate>Sun, 22 Mar 2026 17:53:48 +0800</pubDate><description><![CDATA[先递归到底（分解到单个元素），再逐层向上合并！]]></description><category></category></item><item><title><![CDATA[图的深度优先搜索 (DFS)]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159175897</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159175897</guid><author>qq_27870421</author><pubDate>Tue, 17 Mar 2026 23:35:57 +0800</pubDate><description><![CDATA[🔑核心口诀先深后广，栈来帮忙，标记访问，回溯别忘。]]></description><category></category></item><item><title><![CDATA[拓扑排序（Topological Sort）]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159175879</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159175879</guid><author>qq_27870421</author><pubDate>Tue, 17 Mar 2026 23:34:53 +0800</pubDate><description><![CDATA[拓扑排序是对**有向无环图（DAG, Directed Acyclic Graph）**的节点进行线性排序，使得对于图中的每一条有向边u → v，节点u在排序中都位于节点v之前。]]></description><category></category></item><item><title><![CDATA[图的广度优先搜索 (BFS)]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159175852</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159175852</guid><author>qq_27870421</author><pubDate>Tue, 17 Mar 2026 23:33:10 +0800</pubDate><description><![CDATA[🔑核心口诀先入先出，层层推进，标记访问，避免重复队列是关键：保证先访问的顶点的邻居也先被访问必须标记已访问：防止重复入队和死循环适合找最短路径：第一次访问到目标顶点时，路径一定最短（无权图）空间换时间：用队列存储待访问节点，换取有序的层次遍历多源BFS（多个起始点同时搜索）双向BFS（从起点和终点同时搜索，优化性能）BFS在特定问题中的应用（如岛屿数量、单词接龙等）]]></description><category></category></item><item><title><![CDATA[图的领接矩阵表示法]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159175826</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159175826</guid><author>qq_27870421</author><pubDate>Tue, 17 Mar 2026 23:30:48 +0800</pubDate><description><![CDATA[邻接矩阵是表示图（Graph）的一种经典方式，使用一个二维数组来存储图中顶点之间的连接关系。对于一个具有nnn个顶点的图，邻接矩阵是一个n×nn \times nn×n的方阵AAAAij1或wij如果顶点i和j之间有边0如果顶点i和j之间没有边1 \text{ 或 } w_{ij} & \text{如果顶点 } i \text{ 和 } j \text{ 之间有边} \\]]></description><category></category></item><item><title><![CDATA[图的领接链表表示法]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159175808</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159175808</guid><author>qq_27870421</author><pubDate>Tue, 17 Mar 2026 23:29:29 +0800</pubDate><description><![CDATA[邻接链表是表示图（Graph）的一种高效存储方式。对于图中的每个顶点，我们维护一个链表（或动态数组）来存储所有与该顶点直接相连的邻居顶点。]]></description><category></category></item><item><title><![CDATA[深度优先遍历 与 广度优先遍历]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159132126</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159132126</guid><author>qq_27870421</author><pubDate>Mon, 16 Mar 2026 23:04:04 +0800</pubDate><description><![CDATA[前序、中序、后序三种遍历都是深度优先策略的不同实现，区别在于。]]></description><category></category></item><item><title><![CDATA[二叉树的层序遍历]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159132070</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159132070</guid><author>qq_27870421</author><pubDate>Mon, 16 Mar 2026 22:58:17 +0800</pubDate><description><![CDATA[二叉树的层序遍历（Level-order Traversal），也叫，是按照树的层级从上到下、从左到右依次访问每个节点的遍历方式。]]></description><category></category></item><item><title><![CDATA[二叉树的后序遍历]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159132053</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159132053</guid><author>qq_27870421</author><pubDate>Mon, 16 Mar 2026 22:56:56 +0800</pubDate><description><![CDATA[二叉树的后序遍历（Post-order Traversal）是一种按照的顺序访问树中所有节点的遍历方式。]]></description><category></category></item><item><title><![CDATA[二叉树的前序遍历]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159132032</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159132032</guid><author>qq_27870421</author><pubDate>Mon, 16 Mar 2026 22:55:18 +0800</pubDate><description><![CDATA[二叉树的前序遍历（Pre-order Traversal）是一种按照的顺序访问树中所有节点的遍历方式。]]></description><category></category></item><item><title><![CDATA[二叉树的中序遍历]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159131923</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159131923</guid><author>qq_27870421</author><pubDate>Mon, 16 Mar 2026 22:46:40 +0800</pubDate><description><![CDATA[对于满二叉树，中序遍历总是先访问左子树的所有节点，再到根，最后右子树。节点3的子树（6 → 3 → 7）本身也是一个完整的中序遍历单元。]]></description><category></category></item><item><title><![CDATA[图（Graph）]]></title><link>https://blog.youkuaiyun.com/qq_27870421/article/details/159085615</link><guid>https://blog.youkuaiyun.com/qq_27870421/article/details/159085615</guid><author>qq_27870421</author><pubDate>Sun, 15 Mar 2026 18:09:30 +0800</pubDate><description><![CDATA[图（Graph）是一种非线性数据结构，由顶点（Vertex/Node）和边（Edge）组成，用于表示对象之间的复杂关系。遍历所有邻居   O(V) (即使边很少也要扫一行)   O(text{degree}) (仅遍历存在的边)判断两点是否相连   O(1) (极快)   O(text{degree}) (较慢)// 方便通过名称查找索引。空间复杂度   O(V^2) (V为顶点数)   O(V + E) (E为边数)顶点 (Vertex): 图中的基本单元，代表一个实体（如：人、城市、网页）。]]></description><category></category></item></channel></rss>