[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fCMDVPc4Pxx0QrPNXR0wKBOu8vM73xguotR1fPl0a7XU":3,"$fJU-4tot_gC5fDkujNeoE-cGsdMy5V_KcdUXLuAnTFgw":16,"$f3ruhZOYa38am8GVgSdBmGnEZwXpNCbOOfzCQGLZiH7w":423},{"slug":4,"title":5,"description":6,"content":7,"content_html":8,"pub_date":9,"tags":10,"draft":15},"python-data-structures","Python 内置数据结构深度解析","list、dict、set、tuple 不只是数据容器，搞懂它们的底层实现和时间复杂度，才能写出高性能 Python。","# Python 内置数据结构深度解析\n\nlist、dict、set、tuple 不只是数据容器。搞懂它们的底层实现和时间复杂度，才能写出高性能 Python。\n\n---\n\n## list：动态数组\n\n### 底层实现\nPython 的 `list` 是一个动态数组（dynamic array），底层是一块连续的内存，存储的是对象引用（指针），而非对象本身。\n\n**内存预分配策略**：为了避免每次 append 都重新分配内存，list 会预留额外空间：\n\n```python\nimport sys\n\nlst = []\nsizes = []\nfor i in range(20):\n    sizes.append(sys.getsizeof(lst))\n    lst.append(i)\n\nprint(sizes)\n# 增长模式约为：0, 4, 8, 16, 25, 35, 46, ...\n```\n\n### 时间复杂度\n| 操作 | 复杂度 | 说明 |\n|------|--------|------|\n| `append(x)` | O(1) 均摊 | 偶尔触发扩容 O(n) |\n| `pop()` | O(1) | 尾部删除 |\n| `insert(0, x)` | O(n) | 要移动所有元素 |\n| `pop(0)` | O(n) | 要移动所有元素 |\n| `list[i]` | O(1) | 随机访问 |\n| `x in list` | O(n) | 线性扫描 |\n| `sort()` | O(n log n) | Timsort |\n\n```python\n# 错误示范：用 list 模拟队列（O(n) 出队）\nqueue = []\nqueue.append(1)\nqueue.append(2)\nqueue.pop(0)    # O(n)！\n\n# 正确做法：用 deque\nfrom collections import deque\nq = deque()\nq.append(1)\nq.append(2)\nq.popleft()     # O(1)\n```\n\n### bisect：有序插入\n```python\nimport bisect\n\nsorted_list = [1, 3, 5, 7, 9]\nbisect.insort(sorted_list, 4)    # [1, 3, 4, 5, 7, 9]，O(log n) 查找位置\n\nbisect.bisect_left(sorted_list, 5)   # 2（插入 5 的左边位置）\nbisect.bisect_right(sorted_list, 5)  # 4（插入 5 的右边位置）\n```\n\n---\n\n## dict：哈希表\n\n### 底层实现\nCPython 3.6+ 的 dict 使用了**紧凑哈希表**，3.7+ 开始正式保证**插入顺序**。\n\n实现原理：\n1. 维护一个索引数组（稀疏）和一个按插入顺序排列的条目数组（紧凑）\n2. 通过 `hash(key)` 计算哈希值，映射到索引数组的槽位\n3. 哈希冲突用开放地址法（linear probing + perturbation）解决\n\n```python\n# hash 冲突示例\nprint(hash(\"a\"))       # 某个整数\nprint(hash(1))         # 1\nprint(hash(1.0))       # 1（1 == 1.0，所以 hash 相等）\n```\n\n### 时间复杂度\n| 操作 | 平均 | 最坏（哈希冲突严重） |\n|------|------|---------------------|\n| `d[k]` | O(1) | O(n) |\n| `d[k] = v` | O(1) | O(n) |\n| `del d[k]` | O(1) | O(n) |\n| `k in d` | O(1) | O(n) |\n| `len(d)` | O(1) | - |\n\n### dict 进阶用法\n\n```python\nfrom collections import defaultdict, Counter, OrderedDict, ChainMap\n\n# defaultdict：访问不存在的 key 时自动初始化\nword_count = defaultdict(int)\nfor word in \"hello world hello\".split():\n    word_count[word] += 1\n# {'hello': 2, 'world': 1}\n\n# 构建邻接表\ngraph = defaultdict(list)\nfor u, v in edges:\n    graph[u].append(v)\n\n# Counter：计数器，dict 的子类\nc = Counter(\"abracadabra\")\n# Counter({'a': 5, 'b': 2, 'r': 2, 'c': 1, 'd': 1})\nc.most_common(3)         # [('a', 5), ('b', 2), ('r', 2)]\nc1 + c2                  # 合并计数\nc1 - c2                  # 差集计数\n\n# ChainMap：多个 dict 的逻辑合并（不拷贝）\ndefaults = {\"color\": \"red\", \"size\": 10}\noverrides = {\"color\": \"blue\"}\nconfig = ChainMap(overrides, defaults)\nconfig[\"color\"]    # \"blue\"（先查 overrides）\nconfig[\"size\"]     # 10（overrides 没有，查 defaults）\n```\n\n---\n\n## set \u002F frozenset：哈希集合\n\n### 底层实现\n`set` 本质是一个只有 key 没有 value 的哈希表，内存消耗比 dict 少。\n\n```python\ns1 = {1, 2, 3, 4}\ns2 = {3, 4, 5, 6}\n\ns1 & s2   # 交集：{3, 4}\ns1 | s2   # 并集：{1,2,3,4,5,6}\ns1 - s2   # 差集：{1, 2}\ns1 ^ s2   # 对称差：{1,2,5,6}\n\n# 成员检测对比\nimport time\n\nbig_list = list(range(1000000))\nbig_set = set(big_list)\n\n# list: O(n)\nstart = time.time()\n999999 in big_list\nprint(f\"list: {time.time()-start:.6f}s\")   # ~0.01s\n\n# set: O(1)\nstart = time.time()\n999999 in big_set\nprint(f\"set: {time.time()-start:.6f}s\")    # ~0.000001s\n```\n\n### frozenset\n```python\n# 不可变，可作 dict key 或 set 的元素\nfs = frozenset([1, 2, 3])\n\n# 应用：统计不重复的边（无向图）\nedges = frozenset({frozenset({1,2}), frozenset({2,1})})\nlen(edges)   # 1，因为 {1,2} == {2,1}\n```\n\n---\n\n## tuple：不可变序列\n\n```python\n# tuple 比 list 内存更小\nimport sys\nlst = [1, 2, 3, 4, 5]\ntpl = (1, 2, 3, 4, 5)\nprint(sys.getsizeof(lst))  # 104 bytes\nprint(sys.getsizeof(tpl))  # 80 bytes\n\n# tuple 创建更快\nimport timeit\ntimeit.timeit(\"[1, 2, 3, 4, 5]\", number=1000000)  # ~0.08s\ntimeit.timeit(\"(1, 2, 3, 4, 5)\", number=1000000)  # ~0.02s\n\n# tuple 可作 dict key\nlocations = {\n    (0, 0): \"origin\",\n    (1, 0): \"right\",\n    (0, 1): \"up\",\n}\n\n# 解包\na, b, c = (1, 2, 3)\nfirst, *rest = (1, 2, 3, 4, 5)\n```\n\n---\n\n## collections 模块深度使用\n\n### deque：双端队列\n```python\nfrom collections import deque\n\ndq = deque([1, 2, 3], maxlen=5)  # maxlen 限制大小，满了自动丢弃最旧的\n\ndq.append(4)        # 右端添加 O(1)\ndq.appendleft(0)    # 左端添加 O(1)\ndq.pop()            # 右端删除 O(1)\ndq.popleft()        # 左端删除 O(1)\ndq.rotate(1)        # 循环右移\ndq.rotate(-1)       # 循环左移\n\n# 滑动窗口最大值\ndef sliding_window_max(nums, k):\n    dq = deque()    # 存下标，单调递减\n    result = []\n    for i, x in enumerate(nums):\n        while dq and nums[dq[-1]] \u003C x:\n            dq.pop()\n        dq.append(i)\n        if dq[0] \u003C= i - k:\n            dq.popleft()\n        if i >= k - 1:\n            result.append(nums[dq[0]])\n    return result\n```\n\n### heapq：堆（优先队列）\n```python\nimport heapq\n\nheap = [3, 1, 4, 1, 5, 9, 2, 6]\nheapq.heapify(heap)           # O(n) 原地建堆\n\nheapq.heappush(heap, 0)       # O(log n) 插入\nsmallest = heapq.heappop(heap)  # O(log n) 取最小值\n\n# Top-K 问题\nnums = [3, 1, 4, 1, 5, 9, 2, 6]\nheapq.nlargest(3, nums)    # [9, 6, 5]\nheapq.nsmallest(3, nums)   # [1, 1, 2]\n\n# 最大堆：取反\nheap = [-x for x in nums]\nheapq.heapify(heap)\nmax_val = -heapq.heappop(heap)\n```\n\n---\n\n## 时间复杂度汇总对比\n\n| 操作 | list | dict | set | tuple |\n|------|------|------|-----|-------|\n| 访问元素 `[i]` | O(1) | O(1) | 不支持 | O(1) |\n| 成员检测 `in` | O(n) | O(1) | O(1) | O(n) |\n| 插入（尾部\u002F任意） | O(1)\u002FO(n) | O(1) | O(1) | 不可变 |\n| 删除（尾部\u002F任意） | O(1)\u002FO(n) | O(1) | O(1) | 不可变 |\n| 排序 | O(n log n) | 不支持 | 不支持 | 不支持 |\n| 长度 `len` | O(1) | O(1) | O(1) | O(1) |\n\n---\n\n## 内存占用对比\n\n```python\nimport sys\nfrom collections import namedtuple\n\n# list of tuples\ndata_tuples = [(i, i*2, f\"item_{i}\") for i in range(1000)]\n\n# list of dicts\ndata_dicts = [{\"x\": i, \"y\": i*2, \"name\": f\"item_{i}\"} for i in range(1000)]\n\n# list of namedtuples\nItem = namedtuple(\"Item\", [\"x\", \"y\", \"name\"])\ndata_named = [Item(i, i*2, f\"item_{i}\") for i in range(1000)]\n\nprint(f\"tuples: {sys.getsizeof(data_tuples[0])} bytes each\")  # ~72\nprint(f\"dicts:  {sys.getsizeof(data_dicts[0])} bytes each\")   # ~232\nprint(f\"named:  {sys.getsizeof(data_named[0])} bytes each\")   # ~72\n\n# 结论：存大量结构化数据时，tuple\u002Fnamedtuple 比 dict 节省约 3x 内存\n```\n\n---\n\n## 实际场景选型建议\n\n| 场景 | 推荐结构 | 原因 |\n|------|---------|------|\n| 有序序列，频繁尾部增删 | `list` | 均摊 O(1) |\n| 有序序列，频繁两端增删 | `deque` | 两端 O(1) |\n| 有序序列，需要二分查找 | 排序 `list` + `bisect` | O(log n) 查找 |\n| 键值映射 | `dict` | O(1) 查找 |\n| 计数 | `Counter` | 语义清晰 |\n| 快速成员检测 | `set` | O(1) in |\n| 不可变数据\u002Fdict key | `tuple\u002Ffrozenset` | 可哈希 |\n| 优先队列\u002F最值 | `heapq` | O(log n) |\n| 结构化数据（只读） | `namedtuple\u002Fdataclass` | 语义+内存 |\n","\u003Ch1>Python 内置数据结构深度解析\u003C\u002Fh1>\n\u003Cp>list、dict、set、tuple 不只是数据容器。搞懂它们的底层实现和时间复杂度，才能写出高性能 Python。\u003C\u002Fp>\n\u003Chr>\n\u003Ch2 id=\"list-动态数组\">list：动态数组\u003C\u002Fh2>\n\u003Ch3 id=\"底层实现\">底层实现\u003C\u002Fh3>\n\u003Cp>Python 的 \u003Ccode>list\u003C\u002Fcode> 是一个动态数组（dynamic array），底层是一块连续的内存，存储的是对象引用（指针），而非对象本身。\u003C\u002Fp>\n\u003Cp>\u003Cstrong>内存预分配策略\u003C\u002Fstrong>：为了避免每次 append 都重新分配内存，list 会预留额外空间：\u003C\u002Fp>\n\u003Cpre>\u003Ccode class=\"language-python\">import sys\n\nlst = []\nsizes = []\nfor i in range(20):\n    sizes.append(sys.getsizeof(lst))\n    lst.append(i)\n\nprint(sizes)\n# 增长模式约为：0, 4, 8, 16, 25, 35, 46, ...\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Ch3 id=\"时间复杂度\">时间复杂度\u003C\u002Fh3>\n\u003Ctable>\n\u003Cthead>\n\u003Ctr>\n\u003Cth>操作\u003C\u002Fth>\n\u003Cth>复杂度\u003C\u002Fth>\n\u003Cth>说明\u003C\u002Fth>\n\u003C\u002Ftr>\n\u003C\u002Fthead>\n\u003Ctbody>\n\u003Ctr>\n\u003Ctd>\u003Ccode>append(x)\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(1) 均摊\u003C\u002Ftd>\n\u003Ctd>偶尔触发扩容 O(n)\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>\u003Ccode>pop()\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>尾部删除\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>\u003Ccode>insert(0, x)\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(n)\u003C\u002Ftd>\n\u003Ctd>要移动所有元素\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>\u003Ccode>pop(0)\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(n)\u003C\u002Ftd>\n\u003Ctd>要移动所有元素\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>\u003Ccode>list[i]\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>随机访问\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>\u003Ccode>x in list\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(n)\u003C\u002Ftd>\n\u003Ctd>线性扫描\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>\u003Ccode>sort()\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(n log n)\u003C\u002Ftd>\n\u003Ctd>Timsort\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003C\u002Ftbody>\n\u003C\u002Ftable>\n\u003Cpre>\u003Ccode class=\"language-python\"># 错误示范：用 list 模拟队列（O(n) 出队）\nqueue = []\nqueue.append(1)\nqueue.append(2)\nqueue.pop(0)    # O(n)！\n\n# 正确做法：用 deque\nfrom collections import deque\nq = deque()\nq.append(1)\nq.append(2)\nq.popleft()     # O(1)\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Ch3 id=\"bisect-有序插入\">bisect：有序插入\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-python\">import bisect\n\nsorted_list = [1, 3, 5, 7, 9]\nbisect.insort(sorted_list, 4)    # [1, 3, 4, 5, 7, 9]，O(log n) 查找位置\n\nbisect.bisect_left(sorted_list, 5)   # 2（插入 5 的左边位置）\nbisect.bisect_right(sorted_list, 5)  # 4（插入 5 的右边位置）\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Chr>\n\u003Ch2 id=\"dict-哈希表\">dict：哈希表\u003C\u002Fh2>\n\u003Ch3 id=\"底层实现\">底层实现\u003C\u002Fh3>\n\u003Cp>CPython 3.6+ 的 dict 使用了\u003Cstrong>紧凑哈希表\u003C\u002Fstrong>，3.7+ 开始正式保证\u003Cstrong>插入顺序\u003C\u002Fstrong>。\u003C\u002Fp>\n\u003Cp>实现原理：\u003C\u002Fp>\n\u003Col>\n\u003Cli>维护一个索引数组（稀疏）和一个按插入顺序排列的条目数组（紧凑）\u003C\u002Fli>\n\u003Cli>通过 \u003Ccode>hash(key)\u003C\u002Fcode> 计算哈希值，映射到索引数组的槽位\u003C\u002Fli>\n\u003Cli>哈希冲突用开放地址法（linear probing + perturbation）解决\u003C\u002Fli>\n\u003C\u002Fol>\n\u003Cpre>\u003Ccode class=\"language-python\"># hash 冲突示例\nprint(hash("a"))       # 某个整数\nprint(hash(1))         # 1\nprint(hash(1.0))       # 1（1 == 1.0，所以 hash 相等）\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Ch3 id=\"时间复杂度\">时间复杂度\u003C\u002Fh3>\n\u003Ctable>\n\u003Cthead>\n\u003Ctr>\n\u003Cth>操作\u003C\u002Fth>\n\u003Cth>平均\u003C\u002Fth>\n\u003Cth>最坏（哈希冲突严重）\u003C\u002Fth>\n\u003C\u002Ftr>\n\u003C\u002Fthead>\n\u003Ctbody>\n\u003Ctr>\n\u003Ctd>\u003Ccode>d[k]\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>O(n)\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>\u003Ccode>d[k] = v\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>O(n)\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>\u003Ccode>del d[k]\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>O(n)\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>\u003Ccode>k in d\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>O(n)\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>\u003Ccode>len(d)\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>-\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003C\u002Ftbody>\n\u003C\u002Ftable>\n\u003Ch3 id=\"dict-进阶用法\">dict 进阶用法\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-python\">from collections import defaultdict, Counter, OrderedDict, ChainMap\n\n# defaultdict：访问不存在的 key 时自动初始化\nword_count = defaultdict(int)\nfor word in "hello world hello".split():\n    word_count[word] += 1\n# {'hello': 2, 'world': 1}\n\n# 构建邻接表\ngraph = defaultdict(list)\nfor u, v in edges:\n    graph[u].append(v)\n\n# Counter：计数器，dict 的子类\nc = Counter("abracadabra")\n# Counter({'a': 5, 'b': 2, 'r': 2, 'c': 1, 'd': 1})\nc.most_common(3)         # [('a', 5), ('b', 2), ('r', 2)]\nc1 + c2                  # 合并计数\nc1 - c2                  # 差集计数\n\n# ChainMap：多个 dict 的逻辑合并（不拷贝）\ndefaults = {"color": "red", "size": 10}\noverrides = {"color": "blue"}\nconfig = ChainMap(overrides, defaults)\nconfig["color"]    # "blue"（先查 overrides）\nconfig["size"]     # 10（overrides 没有，查 defaults）\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Chr>\n\u003Ch2 id=\"set-frozenset-哈希集合\">set \u002F frozenset：哈希集合\u003C\u002Fh2>\n\u003Ch3 id=\"底层实现\">底层实现\u003C\u002Fh3>\n\u003Cp>\u003Ccode>set\u003C\u002Fcode> 本质是一个只有 key 没有 value 的哈希表，内存消耗比 dict 少。\u003C\u002Fp>\n\u003Cpre>\u003Ccode class=\"language-python\">s1 = {1, 2, 3, 4}\ns2 = {3, 4, 5, 6}\n\ns1 & s2   # 交集：{3, 4}\ns1 | s2   # 并集：{1,2,3,4,5,6}\ns1 - s2   # 差集：{1, 2}\ns1 ^ s2   # 对称差：{1,2,5,6}\n\n# 成员检测对比\nimport time\n\nbig_list = list(range(1000000))\nbig_set = set(big_list)\n\n# list: O(n)\nstart = time.time()\n999999 in big_list\nprint(f"list: {time.time()-start:.6f}s")   # ~0.01s\n\n# set: O(1)\nstart = time.time()\n999999 in big_set\nprint(f"set: {time.time()-start:.6f}s")    # ~0.000001s\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Ch3 id=\"frozenset\">frozenset\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-python\"># 不可变，可作 dict key 或 set 的元素\nfs = frozenset([1, 2, 3])\n\n# 应用：统计不重复的边（无向图）\nedges = frozenset({frozenset({1,2}), frozenset({2,1})})\nlen(edges)   # 1，因为 {1,2} == {2,1}\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Chr>\n\u003Ch2 id=\"tuple-不可变序列\">tuple：不可变序列\u003C\u002Fh2>\n\u003Cpre>\u003Ccode class=\"language-python\"># tuple 比 list 内存更小\nimport sys\nlst = [1, 2, 3, 4, 5]\ntpl = (1, 2, 3, 4, 5)\nprint(sys.getsizeof(lst))  # 104 bytes\nprint(sys.getsizeof(tpl))  # 80 bytes\n\n# tuple 创建更快\nimport timeit\ntimeit.timeit("[1, 2, 3, 4, 5]", number=1000000)  # ~0.08s\ntimeit.timeit("(1, 2, 3, 4, 5)", number=1000000)  # ~0.02s\n\n# tuple 可作 dict key\nlocations = {\n    (0, 0): "origin",\n    (1, 0): "right",\n    (0, 1): "up",\n}\n\n# 解包\na, b, c = (1, 2, 3)\nfirst, *rest = (1, 2, 3, 4, 5)\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Chr>\n\u003Ch2 id=\"collections-模块深度使用\">collections 模块深度使用\u003C\u002Fh2>\n\u003Ch3 id=\"deque-双端队列\">deque：双端队列\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-python\">from collections import deque\n\ndq = deque([1, 2, 3], maxlen=5)  # maxlen 限制大小，满了自动丢弃最旧的\n\ndq.append(4)        # 右端添加 O(1)\ndq.appendleft(0)    # 左端添加 O(1)\ndq.pop()            # 右端删除 O(1)\ndq.popleft()        # 左端删除 O(1)\ndq.rotate(1)        # 循环右移\ndq.rotate(-1)       # 循环左移\n\n# 滑动窗口最大值\ndef sliding_window_max(nums, k):\n    dq = deque()    # 存下标，单调递减\n    result = []\n    for i, x in enumerate(nums):\n        while dq and nums[dq[-1]] < x:\n            dq.pop()\n        dq.append(i)\n        if dq[0] <= i - k:\n            dq.popleft()\n        if i >= k - 1:\n            result.append(nums[dq[0]])\n    return result\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Ch3 id=\"heapq-堆-优先队列\">heapq：堆（优先队列）\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-python\">import heapq\n\nheap = [3, 1, 4, 1, 5, 9, 2, 6]\nheapq.heapify(heap)           # O(n) 原地建堆\n\nheapq.heappush(heap, 0)       # O(log n) 插入\nsmallest = heapq.heappop(heap)  # O(log n) 取最小值\n\n# Top-K 问题\nnums = [3, 1, 4, 1, 5, 9, 2, 6]\nheapq.nlargest(3, nums)    # [9, 6, 5]\nheapq.nsmallest(3, nums)   # [1, 1, 2]\n\n# 最大堆：取反\nheap = [-x for x in nums]\nheapq.heapify(heap)\nmax_val = -heapq.heappop(heap)\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Chr>\n\u003Ch2 id=\"时间复杂度汇总对比\">时间复杂度汇总对比\u003C\u002Fh2>\n\u003Ctable>\n\u003Cthead>\n\u003Ctr>\n\u003Cth>操作\u003C\u002Fth>\n\u003Cth>list\u003C\u002Fth>\n\u003Cth>dict\u003C\u002Fth>\n\u003Cth>set\u003C\u002Fth>\n\u003Cth>tuple\u003C\u002Fth>\n\u003C\u002Ftr>\n\u003C\u002Fthead>\n\u003Ctbody>\n\u003Ctr>\n\u003Ctd>访问元素 \u003Ccode>[i]\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>不支持\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>成员检测 \u003Ccode>in\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(n)\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>O(n)\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>插入（尾部\u002F任意）\u003C\u002Ftd>\n\u003Ctd>O(1)\u002FO(n)\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>不可变\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>删除（尾部\u002F任意）\u003C\u002Ftd>\n\u003Ctd>O(1)\u002FO(n)\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>不可变\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>排序\u003C\u002Ftd>\n\u003Ctd>O(n log n)\u003C\u002Ftd>\n\u003Ctd>不支持\u003C\u002Ftd>\n\u003Ctd>不支持\u003C\u002Ftd>\n\u003Ctd>不支持\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>长度 \u003Ccode>len\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003Ctd>O(1)\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003C\u002Ftbody>\n\u003C\u002Ftable>\n\u003Chr>\n\u003Ch2 id=\"内存占用对比\">内存占用对比\u003C\u002Fh2>\n\u003Cpre>\u003Ccode class=\"language-python\">import sys\nfrom collections import namedtuple\n\n# list of tuples\ndata_tuples = [(i, i*2, f"item_{i}") for i in range(1000)]\n\n# list of dicts\ndata_dicts = [{"x": i, "y": i*2, "name": f"item_{i}"} for i in range(1000)]\n\n# list of namedtuples\nItem = namedtuple("Item", ["x", "y", "name"])\ndata_named = [Item(i, i*2, f"item_{i}") for i in range(1000)]\n\nprint(f"tuples: {sys.getsizeof(data_tuples[0])} bytes each")  # ~72\nprint(f"dicts:  {sys.getsizeof(data_dicts[0])} bytes each")   # ~232\nprint(f"named:  {sys.getsizeof(data_named[0])} bytes each")   # ~72\n\n# 结论：存大量结构化数据时，tuple\u002Fnamedtuple 比 dict 节省约 3x 内存\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Chr>\n\u003Ch2 id=\"实际场景选型建议\">实际场景选型建议\u003C\u002Fh2>\n\u003Ctable>\n\u003Cthead>\n\u003Ctr>\n\u003Cth>场景\u003C\u002Fth>\n\u003Cth>推荐结构\u003C\u002Fth>\n\u003Cth>原因\u003C\u002Fth>\n\u003C\u002Ftr>\n\u003C\u002Fthead>\n\u003Ctbody>\n\u003Ctr>\n\u003Ctd>有序序列，频繁尾部增删\u003C\u002Ftd>\n\u003Ctd>\u003Ccode>list\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>均摊 O(1)\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>有序序列，频繁两端增删\u003C\u002Ftd>\n\u003Ctd>\u003Ccode>deque\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>两端 O(1)\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>有序序列，需要二分查找\u003C\u002Ftd>\n\u003Ctd>排序 \u003Ccode>list\u003C\u002Fcode> + \u003Ccode>bisect\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(log n) 查找\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>键值映射\u003C\u002Ftd>\n\u003Ctd>\u003Ccode>dict\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(1) 查找\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>计数\u003C\u002Ftd>\n\u003Ctd>\u003Ccode>Counter\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>语义清晰\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>快速成员检测\u003C\u002Ftd>\n\u003Ctd>\u003Ccode>set\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(1) in\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>不可变数据\u002Fdict key\u003C\u002Ftd>\n\u003Ctd>\u003Ccode>tuple\u002Ffrozenset\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>可哈希\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>优先队列\u002F最值\u003C\u002Ftd>\n\u003Ctd>\u003Ccode>heapq\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>O(log n)\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>结构化数据（只读）\u003C\u002Ftd>\n\u003Ctd>\u003Ccode>namedtuple\u002Fdataclass\u003C\u002Fcode>\u003C\u002Ftd>\n\u003Ctd>语义+内存\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003C\u002Ftbody>\n\u003C\u002Ftable>\n","2026-05-03",[11,12,13,14],"python","数据结构","性能","算法",false,[17,30,41,53,62,69,76,83,90,97,107,115,124,133,136,144,153,162,171,181,188,198,204,211,217,226,233,240,248,258,267,276,286,296,306,314,324,335,345,354,362,368,376,384,392,400,408,415],{"slug":18,"title":19,"description":20,"pub_date":21,"tags":22,"draft":15,"word_count":29},"ide-skills-guide","Agent Skills 完全指南：21 款第三方 Skill 深度评测与使用心得","全面评测 21 款第三方 Agent Skills，涵盖 Vue 生态、前端设计、构建工具、实用工具四大分类。从安装配置到实际使用场景，带你了解每个 Skill 的功能特点、最佳实践与使用心得。","2026-06-15",[23,24,25,26,27,28],"agent","skills","AI","效率工具","前端","Vue",4169,{"slug":31,"title":32,"description":33,"pub_date":34,"tags":35,"draft":15,"word_count":40},"linux-kernel-skeleton-struct-funcptr-container_of","Linux 内核骨架：struct、函数指针与 container_of","读懂 Linux 内核源码的三件套：巨大的 struct 组合代替继承、函数指针表实现虚派发、container_of 宏从嵌入成员找回完整对象。","2026-05-09",[36,37,38,39],"linux","kernel","C","container_of",1369,{"slug":42,"title":43,"description":44,"pub_date":45,"tags":46,"draft":15,"word_count":52},"astro-complete-guide-2025","Astro 5 深度剖析：Islands 架构原理、构建优化与 Cloudflare Workers 边缘部署","从编译器视角解析 Astro 5 的 Islands 架构实现原理，Content Layer API 的 Vite 插件机制，Server Islands 的流式渲染，以及如何在 Cloudflare Workers + D1 边缘环境下榨干性能。","2026-05-08",[47,48,49,50,51],"astro","frontend","cloudflare","performance","architecture",3663,{"slug":54,"title":55,"description":56,"pub_date":9,"tags":57,"draft":15,"word_count":61},"llm-prompt-engineering","Prompt Engineering 实战：让 LLM 真正听话的技巧","System prompt 怎么写、Few-shot 怎么设计、Chain-of-Thought 原理，以及常见失败模式和调试方法。",[58,59,60],"ai","llm","工程实践",1723,{"slug":63,"title":64,"description":65,"pub_date":9,"tags":66,"draft":15,"word_count":68},"rag-system-design","RAG 系统设计：从 naive 到 production-ready","Retrieval-Augmented Generation 不只是「向量数据库 + LLM」，分块策略、召回质量、重排序、缓存才是工程核心。",[58,67,59,60],"rag",1613,{"slug":70,"title":71,"description":72,"pub_date":9,"tags":73,"draft":15,"word_count":75},"git-advanced-workflow","Git 进阶工作流：rebase、cherry-pick、bisect 的正确使用","merge 会了，但 rebase 总搞错？bisect 找 bug 提交？interactive rebase 整理历史？这篇一次说清楚。",[74,60],"git",1396,{"slug":77,"title":78,"description":79,"pub_date":9,"tags":80,"draft":15,"word_count":82},"docker-practical-guide","Docker 实战：从会用到用好","会 docker run 不够，Dockerfile 最佳实践、多阶段构建、Compose 编排、镜像瘦身才是日常真正需要的。",[81,36,60],"docker",1268,{"slug":84,"title":85,"description":86,"pub_date":9,"tags":87,"draft":15,"word_count":89},"anthropics-skills-guide","anthropics\u002Fskills：Anthropic 官方 Agent Skills 仓库解析","Anthropic 官方开源的 Agent Skills 标准仓库，127k stars，解析 SKILL.md 规范、17 个示例 skill 的设计模式，以及如何在 Claude Code \u002F Claude.ai \u002F API 中使用",[58,88,23,24],"Claude",2090,{"slug":91,"title":92,"description":93,"pub_date":9,"tags":94,"draft":15,"word_count":96},"karpathy-claude-code-guidelines","Karpathy 的 LLM 编码批评与 CLAUDE.md 最佳实践","基于 Andrej Karpathy 对 LLM 编程助手的观察，forrestchang 提炼出一个 CLAUDE.md 文件，4 条原则解决 AI 编码的典型失控问题：乱猜假设、过度设计、乱改代码、目标不清",[58,88,95,60],"Claude Code",2699,{"slug":98,"title":99,"description":100,"pub_date":9,"tags":101,"draft":15,"word_count":106},"typescript-advanced-patterns","TypeScript 高级模式：让类型系统为你工作","基础 TS 会了但类型总是 any？条件类型、映射类型、模板字面量类型、infer 关键字才是 TS 的真正威力。",[102,103,104,105],"typescript","类型系统","前端工程","高级模式",1419,{"slug":108,"title":109,"description":110,"pub_date":9,"tags":111,"draft":15,"word_count":114},"linux-performance-tuning","Linux 性能调优实战：从 top 到 perf 的完整工具链","遇到性能问题不知道从哪下手？这篇建立系统化的排查思路，从 CPU\u002F内存\u002FIO\u002F网络逐层分析。",[36,13,112,113],"运维","系统编程",1524,{"slug":116,"title":117,"description":118,"pub_date":9,"tags":119,"draft":15,"word_count":123},"python-functional-programming","Python 函数式编程：map\u002Ffilter\u002Freduce 之外","Python 不是纯函数式语言，但 functools、itertools、偏函数、闭包这些工具用好了能让代码简洁一个量级。",[11,120,121,122],"函数式","闭包","装饰器",1867,{"slug":125,"title":126,"description":127,"pub_date":9,"tags":128,"draft":15,"word_count":132},"python-oop-guide","Python 面向对象：__init__ 之外你需要知道的","Python OOP 不只是 class + __init__，魔术方法、描述符、元类才是真正的武器。",[11,129,130,131],"OOP","面向对象","魔术方法",1792,{"slug":4,"title":5,"description":6,"pub_date":9,"tags":134,"draft":15,"word_count":135},[11,12,13,14],1517,{"slug":137,"title":138,"description":139,"pub_date":9,"tags":140,"draft":15,"word_count":143},"python-basics-quick-start","Python 快速上手：写给有编程基础的人","已经会其他语言，想快速掌握 Python 的语法特性和思维方式，这篇是捷径。",[11,141,142],"入门","基础",1607,{"slug":145,"title":146,"description":147,"pub_date":9,"tags":148,"draft":15,"word_count":152},"python-dataclass-pydantic","Python dataclass vs Pydantic：数据类选型指南","dataclass 是标准库的轻量选择，Pydantic v2 是带验证的重武器，什么时候用哪个，这篇说清楚。",[11,149,150,151],"dataclass","pydantic","数据验证",1323,{"slug":154,"title":155,"description":156,"pub_date":9,"tags":157,"draft":15,"word_count":161},"python-asyncio-practical","Python asyncio 实战：从回调地狱到协程优雅","asyncio 是 Python 异步编程的核心，搞懂 event loop、Task、gather 这些概念才能写出真正高效的异步代码。",[11,158,159,160],"asyncio","并发","网络编程",1258,{"slug":163,"title":164,"description":165,"pub_date":9,"tags":166,"draft":15,"word_count":170},"python-type-hints-guide","Python 类型注解完全指南：从入门到实践","Python 3.5+ 引入类型注解，配合 mypy\u002Fpyright 让 Python 也能享受静态类型检查的好处。",[11,167,168,169],"typescript-style","type-hints","工具链",1102,{"slug":172,"title":173,"description":174,"pub_date":175,"tags":176,"draft":15,"word_count":180},"pwa-install-update-button","PWA 踩坑：为什么安装按钮从来不出现","从 beforeinstallprompt 到 Service Worker waiting，把 PWA 的安装与更新提示真正做对","2026-05-02",[177,178,179],"pwa","javascript","web",1683,{"slug":182,"title":183,"description":184,"pub_date":185,"tags":186,"draft":15,"word_count":187},"openclaw-vs-hermes-agent","OpenClaw vs Hermes Agent：两个本地优先 Agent 的设计差异","OpenClaw（Novita AI）和 Hermes Agent（Nous Research）都是本地运行的个人 AI Agent，但在记忆系统、技能学习、运行环境和模型生态上走了不同的路。深入对比两种架构的核心差异。","2026-05-01",[58,23,59],1679,{"slug":189,"title":190,"description":191,"pub_date":185,"tags":192,"draft":15,"word_count":197},"cpp-random-design-patterns","C++ 设计模式实战：RAII、观察者、工厂","用现代 C++（C++17\u002F20）实现三种高频设计模式：RAII 资源管理、观察者模式事件系统、工厂模式插件架构。每种模式给出问题场景、实现代码和真实工程案例。",[193,194,195,196],"cpp","设计模式","c++17","工程",2613,{"slug":199,"title":200,"description":201,"pub_date":185,"tags":202,"draft":15,"word_count":203},"data-structures-fundamentals","数据结构基础：从数组到红黑树","系统梳理常用数据结构的核心原理、时间复杂度和适用场景。数组、链表、栈、队列、哈希表、二叉树、堆、图，每种结构附实现要点和 C++ 代码片段。",[12,14,193,142],3004,{"slug":205,"title":206,"description":207,"pub_date":208,"tags":209,"draft":15,"word_count":210},"ai-agent-what-is","什么是 AI Agent？从 LLM 到自主执行","LLM 本身是无状态问答机，Agent 是什么让它’动’起来的？本文深入解析 Agent 的四个核心能力、ReAct 框架、工具调用原理，以及主流框架横向对比。","2026-04-30",[58,23,59],2116,{"slug":212,"title":213,"description":214,"pub_date":208,"tags":215,"draft":15,"word_count":216},"ai-agent-memory","AI Agent 的记忆系统：从上下文窗口到长期记忆","深入拆解 AI Agent 的四种记忆类型、上下文窗口压缩策略、RAG 向量检索原理，以及三种典型失败模式和工程选型建议。",[58,23,67],2052,{"slug":218,"title":219,"description":220,"pub_date":208,"tags":221,"draft":15,"word_count":225},"network-proxy-vpn-guide","代理与翻墙技术原理：从 HTTP 代理到现代协议","深入解析代理与 VPN 的本质区别，梳理从 SOCKS5 到 Shadowsocks、V2Ray\u002FXray、Hysteria2 的协议演进，以及机场订阅的技术本质。",[222,223,224],"网络","代理","协议",2148,{"slug":227,"title":228,"description":229,"pub_date":208,"tags":230,"draft":15,"word_count":143},"algorithm-binary-search","二分查找：永远写不对？记住这个模板","彻底搞清楚二分查找的边界问题：闭区间和左闭右开两套模板、三道经典 LeetCode 题目完整 C++ 实现，以及二分答案的进阶思路。",[14,231,232,193],"二分查找","leetcode",{"slug":234,"title":235,"description":236,"pub_date":208,"tags":237,"draft":15,"word_count":239},"algorithm-sliding-window","滑动窗口算法：从暴力到 O(n) 的思维跃迁","系统讲解滑动窗口算法的核心模板、适用题型，配合三道经典 LeetCode 题目的完整 C++ 实现，彻底理解双指针收缩思路。",[14,238,232,193],"滑动窗口",1943,{"slug":241,"title":242,"description":243,"pub_date":208,"tags":244,"draft":15,"word_count":247},"network-clash-config","Clash \u002F Mihomo 配置详解：规则、策略组与分流","深入解析 Clash\u002FMihomo 的核心配置结构，包括代理节点、策略组类型、规则优先级、DNS fake-ip 模式，以及一份实用的完整配置模板。",[222,245,223,246],"clash","配置",1292,{"slug":249,"title":250,"description":251,"pub_date":252,"tags":253,"draft":15,"word_count":257},"hid-hotplug","HID 设备热插拔检测：从 udev 到 node-hid","在 Linux 上用 node-hid + usb 库实现可靠的 USB HID 设备热插拔检测，踩坑记录","2026-04-28",[193,254,36,255,256],"hid","nodejs","electron",2039,{"slug":259,"title":260,"description":261,"pub_date":262,"tags":263,"draft":15,"word_count":266},"electron-ipc-types","Electron IPC 类型安全：从 any 到完全类型化","用 TypeScript 泛型封装 Electron IPC，彻底消灭 any，preload 契约集中管理","2026-04-25",[256,102,264,265],"ipc","vue",1446,{"slug":268,"title":269,"description":270,"pub_date":271,"tags":272,"draft":15,"word_count":275},"element-plus-popover-hide","手动关闭多个 el-popover（不用 v-model:visible）","通过 ref + Reflect.get 调用 hide() 方法手动关闭 Element Plus Popover，解释 Vue3 Proxy 导致无法直接调用实例方法的原因。","2024-10-25",[265,273,274],"element-plus","vue3",1321,{"slug":277,"title":278,"description":279,"pub_date":280,"tags":281,"draft":15,"word_count":285},"vite-vue3-ts-elementplus-pinia","用 Vite+（vp）从零搭建 Vue3 + TypeScript + Element Plus + Pinia + Vue Router","使用 Vite+ 统一工具链（vp）一条命令搭建 Vue3 全家桶，涵盖按需导入、Pinia store、路由配置，以及常见坑的解决方案。","2024-08-27",[265,282,102,273,283,284],"vite","pinia","vite-plus",1960,{"slug":287,"title":288,"description":289,"pub_date":290,"tags":291,"draft":15,"word_count":295},"cef-lnk2038-iterator-debug-level","CEF LNK2038：解决 _ITERATOR_DEBUG_LEVEL 不匹配错误","分析 CEF（Chromium Embedded Framework）集成时出现的 LNK2038 _ITERATOR_DEBUG_LEVEL 链接错误，从根本原因到解决方案的完整指南。","2024-05-07",[193,292,293,294],"CEF","Visual Studio","链接错误",1509,{"slug":297,"title":298,"description":299,"pub_date":300,"tags":301,"draft":15,"word_count":305},"npm-electron-install-fix","彻底解决 npm 安装 Electron 失败的问题","分析 npm install electron 失败的根本原因（下载二进制超时\u002F被墙），通过国内镜像（npmmirror）彻底解决，并介绍多种备选方案和常见错误排查。","2024-03-01",[256,302,303,304],"npm","前端工具链","国内镜像",1494,{"slug":307,"title":308,"description":309,"pub_date":310,"tags":311,"draft":15,"word_count":313},"git-out-of-memory","解决 git 报错：Fatal: Out of memory, malloc failed","分析 git 大仓库操作时出现 Out of memory malloc failed 的根本原因，通过调整 pack.windowMemory、http.postBuffer 和 git repack 彻底解决。","2024-01-31",[74,36,312],"工具",2244,{"slug":315,"title":316,"description":317,"pub_date":318,"tags":319,"draft":15,"word_count":323},"vmware-tools-install","在 VMware 虚拟机中安装 open-vm-tools 完整指南","详解 VMware Tools 的作用、open-vm-tools 与官方 VMware Tools 的区别，以及在 Ubuntu 虚拟机中安装并生效的完整步骤和常见问题排查。","2023-11-21",[320,36,321,322],"VMware","Ubuntu","虚拟机",2523,{"slug":325,"title":326,"description":327,"pub_date":328,"tags":329,"draft":15,"word_count":334},"load-balancing-algorithms","负载均衡算法完全指南：从轮询到一致性哈希","系统梳理静态与动态负载均衡算法，涵盖轮询、随机、权重、IP Hash、一致性 Hash、最少连接、最快响应等，并对比 Nginx、Dubbo、Spring Cloud LoadBalancer 的实现差异。","2023-11-15",[330,331,332,333],"分布式","负载均衡","Nginx","微服务",1764,{"slug":336,"title":337,"description":338,"pub_date":339,"tags":340,"draft":15,"word_count":344},"win-cw2a-ca2w","ATL 字符串转换：CW2A 与 CA2W 完全指南","详解 ATL 宏 CW2A\u002FCA2W 在 Unicode 与 ANSI 之间的字符串转换用法、头文件依赖、USES_CONVERSION 宏的作用与常见陷阱。","2023-06-09",[193,341,342,343],"windows","ATL","字符串",1665,{"slug":346,"title":347,"description":348,"pub_date":339,"tags":349,"draft":15,"word_count":353},"csharp-sendmessage-cpp","C# 通过 SendMessage 向 C++ 窗口发送消息与字符串","使用 P\u002FInvoke 调用 user32.dll 的 SendMessage，从 C# 发送自定义 WM_USER 消息及字符串指针给 C++ 原生窗口，并在 C++ 侧正确接收和转换。",[350,193,341,351,352],"C#","互操作","PInvoke",1554,{"slug":355,"title":356,"description":357,"pub_date":358,"tags":359,"draft":15,"word_count":361},"win-postmessage-vector","Windows PostMessage 跨线程传递 std::vector 指针","通过 PostMessage 在 Windows 消息队列中传递 std::vector 指针，使用 reinterpret_cast 将指针装入 LPARAM，并在接收方正确释放内存。","2023-05-26",[193,341,360],"WinAPI",1823,{"slug":363,"title":364,"description":365,"pub_date":358,"tags":366,"draft":15,"word_count":367},"exe-dll-single-package","将 EXE 和 DLL 打包成单一可执行文件","介绍两种将 exe 和依赖 dll 打包成单文件的方案：Enigma Virtual Box 和 WinRAR 自解压，适合发布 Windows 桌面程序时简化分发流程。",[341,193,312],1619,{"slug":369,"title":370,"description":371,"pub_date":358,"tags":372,"draft":15,"word_count":375},"cpp-random-mt19937","C++ 现代随机数生成：用 mt19937 彻底告别 rand()","深入讲解为什么 rand() 不够用，以及如何用 C++11 的 \u003Crandom> 库正确生成高质量随机数，涵盖 mt19937、各种分布和线程安全。",[193,373,374],"c++11","random",1549,{"slug":377,"title":378,"description":379,"pub_date":380,"tags":381,"draft":15,"word_count":383},"win-startup-registry","C++ 实现程序开机自启动：注册表方式详解","通过操作 Windows 注册表 Run 键实现程序开机自启动，包括 HKCU 与 HKLM 区别、完整封装代码、工作目录问题和 UAC 权限处理。","2022-12-26",[341,193,382],"registry",1201,{"slug":385,"title":386,"description":387,"pub_date":388,"tags":389,"draft":15,"word_count":391},"mfc-cstring-wparam","MFC 中 CString 与 WPARAM 之间的转换","详解 MFC 消息传递中 CString 无法直接强转为 WPARAM 的原因，以及两种正确的转换方案，并介绍结构体指针传递的正确姿势。","2022-11-25",[390,193,341],"mfc",1546,{"slug":393,"title":394,"description":395,"pub_date":396,"tags":397,"draft":15,"word_count":399},"duilib-static-build","正确编译 Duilib 静态库：避免 ATL 依赖和链接错误","详解如何用 DuiLib_Static.vcxproj 编译 Duilib 静态库，解决 VARIANT 未定义、Unicode 配置不匹配和 ATL 依赖等常见问题。","2022-08-24",[193,398,341,390],"duilib",2639,{"slug":401,"title":402,"description":403,"pub_date":404,"tags":405,"draft":15,"word_count":407},"mfc-dpi-adaptive","MFC 界面自适应不同分辨率","MFC 对话框程序实现控件和字体随分辨率自动缩放的完整方案，附 DPI Awareness 配置说明","2022-08-17",[390,193,341,406],"dpi",1414,{"slug":409,"title":410,"description":411,"pub_date":412,"tags":413,"draft":15,"word_count":414},"mfc-drag-window","MFC 无标题栏窗口客户区拖动：三种方法对比","MFC 对话框去掉标题栏后如何实现拖动移动窗口，三种方案完整实现与适用场景分析","2022-08-16",[390,193,341],1633,{"slug":416,"title":417,"description":418,"pub_date":419,"tags":420,"draft":15,"word_count":422},"algorithm-number-complement","整数的补数：位运算掩码解法","LeetCode 476 题，用掩码 XOR 实现整数补数，附 C++\u002FPython\u002FJava 三种实现及补数与补码的区别","2021-03-08",[14,421,232],"位运算",1374,[]]