[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fhxcsRqJWK5MczWZ-aNjbhnStJrVYxzqCr967QKkWfJY":3,"$fJU-4tot_gC5fDkujNeoE-cGsdMy5V_KcdUXLuAnTFgw":15,"$faMmEB7GrotNfNN0FZUY2cWKt2xKU21SsEOJXnMZQQAA":423},{"slug":4,"title":5,"description":6,"content":7,"content_html":8,"pub_date":9,"tags":10,"draft":14},"cpp-random-mt19937","C++ 现代随机数生成：用 mt19937 彻底告别 rand()","深入讲解为什么 rand() 不够用，以及如何用 C++11 的 \u003Crandom> 库正确生成高质量随机数，涵盖 mt19937、各种分布和线程安全。","import Chart from '..\u002F..\u002Fcomponents\u002FChart.vue'\n\nexport const randRadarData = {\n  labels: ['分布质量', '可读性', '线程安全', '种子质量', '分布灵活性'],\n  datasets: [\n    {\n      label: 'rand()',\n      data: [2, 2, 1, 1, 1],\n      backgroundColor: 'rgba(255,0,170,0.2)',\n      borderColor: 'rgba(255,0,170,0.9)',\n      borderWidth: 2,\n      pointBackgroundColor: 'rgba(255,0,170,0.9)',\n    },\n    {\n      label: 'mt19937',\n      data: [5, 5, 4, 5, 5],\n      backgroundColor: 'rgba(0,212,255,0.2)',\n      borderColor: 'rgba(0,212,255,0.9)',\n      borderWidth: 2,\n      pointBackgroundColor: 'rgba(0,212,255,0.9)',\n    },\n  ],\n}\n\nexport const randRadarOptions = {\n  scales: {\n    r: {\n      min: 0,\n      max: 5,\n      ticks: { display: false, stepSize: 1 },\n      grid: { color: 'rgba(136,136,170,0.25)' },\n      angleLines: { color: 'rgba(136,136,170,0.25)' },\n      pointLabels: { color: '#c8c8d8', font: { family: 'JetBrains Mono', size: 11 } },\n    },\n  },\n}\n\nC++ 里生成随机数，很多人第一反应是 `rand()`。但在实际项目中，`rand()` 几乎是一个\"应该被遗忘\"的函数。C++11 引入的 `\u003Crandom>` 库提供了一套工业级的随机数解决方案，本文带你彻底搞清楚怎么用。\n\n---\n\n## 为什么 `rand()` 不够用\n\n### 1. 固定种子，结果可预测\n\n```cpp\nsrand(42);\nfor (int i = 0; i \u003C 5; ++i)\n    std::cout \u003C\u003C rand() \u003C\u003C \" \";\n\u002F\u002F 每次运行输出完全相同\n```\n\n很多人用 `srand(time(NULL))` 来解决这个问题，但 `time()` 精度只到秒——同一秒内启动的多个进程会得到完全相同的序列。\n\n### 2. 范围限制，分布不均\n\n```cpp\n\u002F\u002F 生成 [0, 99] 的随机数\nint r = rand() % 100;\n```\n\n这行代码有个经典问题：`RAND_MAX` 通常是 32767，不能被 100 整除，导致小数字出现概率略高于大数字。数据量大时，这个偏差会被放大。\n\n### 3. 线程不安全\n\n`rand()` 内部维护全局状态，多线程同时调用会产生数据竞争，结果不可预期。\n\n### 4. 质量差\n\n`rand()` 通常基于线性同余生成器（LCG），统计质量较差，不适合科学计算、模拟或密码学相关场景。\n\n---\n\n## C++11 `\u003Crandom>` 的正确打开方式\n\n`\u003Crandom>` 库的设计把**随机引擎**和**分布**分开，这是它最核心的思想：\n\n- **引擎（Engine）**：负责产生均匀分布的原始随机比特\n- **分布（Distribution）**：把原始比特变换成你需要的数学分布\n\n```cpp\n#include \u003Ciostream>\n#include \u003Crandom>\n\nint main() {\n    \u002F\u002F 1. 用硬件熵源生成真随机种子\n    std::random_device rd;\n    \n    \u002F\u002F 2. 用种子初始化 mt19937 引擎\n    std::mt19937 gen(rd());\n    \n    \u002F\u002F 3. 定义分布：整数均匀分布 [1, 65535]\n    std::uniform_int_distribution\u003Cint> dis(1, 65535);\n    \n    \u002F\u002F 4. 生成随机数\n    for (int i = 0; i \u003C 5; ++i) {\n        std::cout \u003C\u003C dis(gen) \u003C\u003C \" \";\n    }\n    std::cout \u003C\u003C \"\\n\";\n    \n    return 0;\n}\n```\n\n---\n\n## random_device：硬件熵源\n\n`std::random_device` 是一个非确定性随机数生成器，通常来自操作系统的熵池（Linux 下是 `\u002Fdev\u002Furandom`，Windows 下是 `CryptGenRandom`）。\n\n```cpp\nstd::random_device rd;\nunsigned int seed = rd(); \u002F\u002F 每次调用返回一个随机数\n```\n\n**注意**：`random_device` 在某些嵌入式平台或旧 MinGW 编译器上可能退化为伪随机数生成器（质量与 rand() 无异）。可以通过检查 `rd.entropy()` 是否为 0 来判断：\n\n```cpp\nstd::random_device rd;\nif (rd.entropy() == 0) {\n    \u002F\u002F 退化模式，用其他种子策略\n    std::cerr \u003C\u003C \"警告：random_device 不支持真随机，使用时间戳作为备选种子\\n\";\n}\n```\n\n在大多数 Linux\u002FmacOS\u002FMSVC 环境下不需要担心这个问题。\n\n---\n\n## mt19937：最常用的伪随机引擎\n\n`std::mt19937` 基于 **Mersenne Twister** 算法（1997 年提出），有以下特点：\n\n- 周期极长：$2^{19937} - 1$\n- 通过了大多数统计随机性测试\n- 速度快，适合大量生成\n- 32 位版本 `mt19937`，64 位版本 `mt19937_64`\n\n```cpp\n\u002F\u002F 32 位引擎\nstd::mt19937 gen32(seed);\n\n\u002F\u002F 64 位引擎（适合需要大随机数的场景）\nstd::mt19937_64 gen64(seed);\n```\n\n**初始化种子的最佳实践**：单个 `random_device` 值已经够用，如果追求极高质量，可以用 `seed_seq` 用多个值初始化：\n\n```cpp\nstd::random_device rd;\nstd::seed_seq seed_seq{rd(), rd(), rd(), rd(), rd()};\nstd::mt19937 gen(seed_seq);\n```\n\n---\n\n## 常用分布类型\n\n### 整数均匀分布\n\n```cpp\nstd::uniform_int_distribution\u003Cint> dis(1, 100); \u002F\u002F [1, 100] 闭区间\nint r = dis(gen);\n```\n\n### 浮点均匀分布\n\n```cpp\nstd::uniform_real_distribution\u003Cdouble> dis(0.0, 1.0); \u002F\u002F [0.0, 1.0)\ndouble r = dis(gen);\n```\n\n### 正态分布（高斯分布）\n\n```cpp\n\u002F\u002F 均值 0，标准差 1\nstd::normal_distribution\u003Cdouble> dis(0.0, 1.0);\ndouble r = dis(gen);\n```\n\n适用于模拟噪声、物理量波动等场景。\n\n### 伯努利分布（抛硬币）\n\n```cpp\n\u002F\u002F 70% 概率为 true\nstd::bernoulli_distribution dis(0.7);\nbool result = dis(gen);\n```\n\n### 泊松分布\n\n```cpp\n\u002F\u002F 平均每分钟 4 次事件\nstd::poisson_distribution\u003Cint> dis(4.0);\nint events = dis(gen);\n```\n\n### 离散分布（自定义权重）\n\n```cpp\n\u002F\u002F 三个选项，权重分别为 1, 2, 3（概率 1\u002F6, 2\u002F6, 3\u002F6）\nstd::discrete_distribution\u003Cint> dis({1, 2, 3});\nint choice = dis(gen); \u002F\u002F 返回 0, 1 或 2\n```\n\n---\n\n## 线程安全注意事项\n\n`mt19937` 和分布对象**都不是线程安全的**，不能在多线程中共享。\n\n### 方案一：每线程独立引擎（推荐）\n\n```cpp\n#include \u003Cthread>\n#include \u003Crandom>\n\nvoid worker(int thread_id) {\n    \u002F\u002F 每个线程独立的引擎，用线程 id 区分种子\n    std::random_device rd;\n    std::mt19937 gen(rd() ^ (thread_id * 0x12345678));\n    std::uniform_int_distribution\u003Cint> dis(1, 100);\n    \n    for (int i = 0; i \u003C 10; ++i) {\n        std::cout \u003C\u003C dis(gen) \u003C\u003C \" \";\n    }\n}\n```\n\n### 方案二：thread_local 存储\n\n```cpp\nthread_local std::mt19937 gen(std::random_device{}());\n\nint random_int(int lo, int hi) {\n    std::uniform_int_distribution\u003Cint> dis(lo, hi);\n    return dis(gen);\n}\n```\n\n`thread_local` 让每个线程拥有自己的 `gen` 实例，安全且高效。\n\n### 方案三：互斥锁（不推荐，性能差）\n\n```cpp\nstd::mutex mtx;\nstd::mt19937 gen(std::random_device{}());\n\nint random_int_safe(int lo, int hi) {\n    std::lock_guard\u003Cstd::mutex> lock(mtx);\n    std::uniform_int_distribution\u003Cint> dis(lo, hi);\n    return dis(gen);\n}\n```\n\n---\n\n## 完整工具函数示例\n\n```cpp\n#include \u003Crandom>\n#include \u003Cstdexcept>\n\n\u002F\u002F 线程安全的随机工具（thread_local 方案）\nnamespace rng {\n\n\u002F\u002F 获取线程本地引擎\ninline std::mt19937& engine() {\n    thread_local std::mt19937 gen(std::random_device{}());\n    return gen;\n}\n\n\u002F\u002F 生成整数 [lo, hi]\ninline int randint(int lo, int hi) {\n    if (lo > hi) throw std::invalid_argument(\"lo > hi\");\n    std::uniform_int_distribution\u003Cint> dis(lo, hi);\n    return dis(engine());\n}\n\n\u002F\u002F 生成浮点数 [lo, hi)\ninline double randf(double lo = 0.0, double hi = 1.0) {\n    std::uniform_real_distribution\u003Cdouble> dis(lo, hi);\n    return dis(engine());\n}\n\n\u002F\u002F 以概率 p 返回 true\ninline bool chance(double p) {\n    std::bernoulli_distribution dis(p);\n    return dis(engine());\n}\n\n} \u002F\u002F namespace rng\n\n\u002F\u002F 使用\nint main() {\n    for (int i = 0; i \u003C 10; ++i) {\n        std::cout \u003C\u003C rng::randint(1, 6) \u003C\u003C \" \"; \u002F\u002F 模拟骰子\n    }\n    std::cout \u003C\u003C \"\\n\";\n    \n    if (rng::chance(0.3)) {\n        std::cout \u003C\u003C \"30% 概率触发！\\n\";\n    }\n    \n    return 0;\n}\n```\n\n---\n\n## 小结\n\n| 对比项 | `rand()` | `\u003Crandom>` |\n|--------|----------|------------|\n| 分布质量 | 差 | 高（可选） |\n| 指定分布 | 需手动换算 | 内置多种分布 |\n| 线程安全 | 否 | 手动管理（thread_local） |\n| 种子质量 | 差（time） | 好（random_device） |\n| 可读性 | 低 | 高 |\n\n\u003CChart client:only=\"vue\" type=\"radar\" data={randRadarData} options={randRadarOptions} height={260} \u002F>\n\n从 C++11 开始，`\u003Crandom>` 已经完全可以替代 `rand()`。下次写随机数相关代码时，记得用 `mt19937` + 对应分布，彻底告别那个\"能用但很糟\"的老朋友。","\u003Cp>import Chart from ‘…\u002F…\u002Fcomponents\u002FChart.vue’\u003C\u002Fp>\n\u003Cp>export const randRadarData = {\nlabels: [‘分布质量’, ‘可读性’, ‘线程安全’, ‘种子质量’, ‘分布灵活性’],\ndatasets: [\n{\nlabel: ‘rand()’,\ndata: [2, 2, 1, 1, 1],\nbackgroundColor: ‘rgba(255,0,170,0.2)’,\nborderColor: ‘rgba(255,0,170,0.9)’,\nborderWidth: 2,\npointBackgroundColor: ‘rgba(255,0,170,0.9)’,\n},\n{\nlabel: ‘mt19937’,\ndata: [5, 5, 4, 5, 5],\nbackgroundColor: ‘rgba(0,212,255,0.2)’,\nborderColor: ‘rgba(0,212,255,0.9)’,\nborderWidth: 2,\npointBackgroundColor: ‘rgba(0,212,255,0.9)’,\n},\n],\n}\u003C\u002Fp>\n\u003Cp>export const randRadarOptions = {\nscales: {\nr: {\nmin: 0,\nmax: 5,\nticks: { display: false, stepSize: 1 },\ngrid: { color: ‘rgba(136,136,170,0.25)’ },\nangleLines: { color: ‘rgba(136,136,170,0.25)’ },\npointLabels: { color: ‘#c8c8d8’, font: { family: ‘JetBrains Mono’, size: 11 } },\n},\n},\n}\u003C\u002Fp>\n\u003Cp>C++ 里生成随机数，很多人第一反应是 \u003Ccode>rand()\u003C\u002Fcode>。但在实际项目中，\u003Ccode>rand()\u003C\u002Fcode> 几乎是一个"应该被遗忘"的函数。C++11 引入的 \u003Ccode><random>\u003C\u002Fcode> 库提供了一套工业级的随机数解决方案，本文带你彻底搞清楚怎么用。\u003C\u002Fp>\n\u003Chr>\n\u003Ch2 id=\"为什么-rand-不够用\">为什么 \u003Ccode>rand()\u003C\u002Fcode> 不够用\u003C\u002Fh2>\n\u003Ch3 id=\"1-固定种子-结果可预测\">1. 固定种子，结果可预测\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-cpp\">srand(42);\nfor (int i = 0; i < 5; ++i)\n    std::cout << rand() << " ";\n\u002F\u002F 每次运行输出完全相同\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Cp>很多人用 \u003Ccode>srand(time(NULL))\u003C\u002Fcode> 来解决这个问题，但 \u003Ccode>time()\u003C\u002Fcode> 精度只到秒——同一秒内启动的多个进程会得到完全相同的序列。\u003C\u002Fp>\n\u003Ch3 id=\"2-范围限制-分布不均\">2. 范围限制，分布不均\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-cpp\">\u002F\u002F 生成 [0, 99] 的随机数\nint r = rand() % 100;\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Cp>这行代码有个经典问题：\u003Ccode>RAND_MAX\u003C\u002Fcode> 通常是 32767，不能被 100 整除，导致小数字出现概率略高于大数字。数据量大时，这个偏差会被放大。\u003C\u002Fp>\n\u003Ch3 id=\"3-线程不安全\">3. 线程不安全\u003C\u002Fh3>\n\u003Cp>\u003Ccode>rand()\u003C\u002Fcode> 内部维护全局状态，多线程同时调用会产生数据竞争，结果不可预期。\u003C\u002Fp>\n\u003Ch3 id=\"4-质量差\">4. 质量差\u003C\u002Fh3>\n\u003Cp>\u003Ccode>rand()\u003C\u002Fcode> 通常基于线性同余生成器（LCG），统计质量较差，不适合科学计算、模拟或密码学相关场景。\u003C\u002Fp>\n\u003Chr>\n\u003Ch2 id=\"c-11-random-的正确打开方式\">C++11 \u003Ccode><random>\u003C\u002Fcode> 的正确打开方式\u003C\u002Fh2>\n\u003Cp>\u003Ccode><random>\u003C\u002Fcode> 库的设计把\u003Cstrong>随机引擎\u003C\u002Fstrong>和\u003Cstrong>分布\u003C\u002Fstrong>分开，这是它最核心的思想：\u003C\u002Fp>\n\u003Cul>\n\u003Cli>\u003Cstrong>引擎（Engine）\u003C\u002Fstrong>：负责产生均匀分布的原始随机比特\u003C\u002Fli>\n\u003Cli>\u003Cstrong>分布（Distribution）\u003C\u002Fstrong>：把原始比特变换成你需要的数学分布\u003C\u002Fli>\n\u003C\u002Ful>\n\u003Cpre>\u003Ccode class=\"language-cpp\">#include <iostream>\n#include <random>\n\nint main() {\n    \u002F\u002F 1. 用硬件熵源生成真随机种子\n    std::random_device rd;\n    \n    \u002F\u002F 2. 用种子初始化 mt19937 引擎\n    std::mt19937 gen(rd());\n    \n    \u002F\u002F 3. 定义分布：整数均匀分布 [1, 65535]\n    std::uniform_int_distribution<int> dis(1, 65535);\n    \n    \u002F\u002F 4. 生成随机数\n    for (int i = 0; i < 5; ++i) {\n        std::cout << dis(gen) << " ";\n    }\n    std::cout << "\\n";\n    \n    return 0;\n}\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Chr>\n\u003Ch2 id=\"random_device-硬件熵源\">random_device：硬件熵源\u003C\u002Fh2>\n\u003Cp>\u003Ccode>std::random_device\u003C\u002Fcode> 是一个非确定性随机数生成器，通常来自操作系统的熵池（Linux 下是 \u003Ccode>\u002Fdev\u002Furandom\u003C\u002Fcode>，Windows 下是 \u003Ccode>CryptGenRandom\u003C\u002Fcode>）。\u003C\u002Fp>\n\u003Cpre>\u003Ccode class=\"language-cpp\">std::random_device rd;\nunsigned int seed = rd(); \u002F\u002F 每次调用返回一个随机数\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Cp>\u003Cstrong>注意\u003C\u002Fstrong>：\u003Ccode>random_device\u003C\u002Fcode> 在某些嵌入式平台或旧 MinGW 编译器上可能退化为伪随机数生成器（质量与 rand() 无异）。可以通过检查 \u003Ccode>rd.entropy()\u003C\u002Fcode> 是否为 0 来判断：\u003C\u002Fp>\n\u003Cpre>\u003Ccode class=\"language-cpp\">std::random_device rd;\nif (rd.entropy() == 0) {\n    \u002F\u002F 退化模式，用其他种子策略\n    std::cerr << "警告：random_device 不支持真随机，使用时间戳作为备选种子\\n";\n}\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Cp>在大多数 Linux\u002FmacOS\u002FMSVC 环境下不需要担心这个问题。\u003C\u002Fp>\n\u003Chr>\n\u003Ch2 id=\"mt19937-最常用的伪随机引擎\">mt19937：最常用的伪随机引擎\u003C\u002Fh2>\n\u003Cp>\u003Ccode>std::mt19937\u003C\u002Fcode> 基于 \u003Cstrong>Mersenne Twister\u003C\u002Fstrong> 算法（1997 年提出），有以下特点：\u003C\u002Fp>\n\u003Cul>\n\u003Cli>周期极长：$2^{19937} - 1$\u003C\u002Fli>\n\u003Cli>通过了大多数统计随机性测试\u003C\u002Fli>\n\u003Cli>速度快，适合大量生成\u003C\u002Fli>\n\u003Cli>32 位版本 \u003Ccode>mt19937\u003C\u002Fcode>，64 位版本 \u003Ccode>mt19937_64\u003C\u002Fcode>\u003C\u002Fli>\n\u003C\u002Ful>\n\u003Cpre>\u003Ccode class=\"language-cpp\">\u002F\u002F 32 位引擎\nstd::mt19937 gen32(seed);\n\n\u002F\u002F 64 位引擎（适合需要大随机数的场景）\nstd::mt19937_64 gen64(seed);\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Cp>\u003Cstrong>初始化种子的最佳实践\u003C\u002Fstrong>：单个 \u003Ccode>random_device\u003C\u002Fcode> 值已经够用，如果追求极高质量，可以用 \u003Ccode>seed_seq\u003C\u002Fcode> 用多个值初始化：\u003C\u002Fp>\n\u003Cpre>\u003Ccode class=\"language-cpp\">std::random_device rd;\nstd::seed_seq seed_seq{rd(), rd(), rd(), rd(), rd()};\nstd::mt19937 gen(seed_seq);\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Chr>\n\u003Ch2 id=\"常用分布类型\">常用分布类型\u003C\u002Fh2>\n\u003Ch3 id=\"整数均匀分布\">整数均匀分布\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-cpp\">std::uniform_int_distribution<int> dis(1, 100); \u002F\u002F [1, 100] 闭区间\nint r = dis(gen);\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Ch3 id=\"浮点均匀分布\">浮点均匀分布\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-cpp\">std::uniform_real_distribution<double> dis(0.0, 1.0); \u002F\u002F [0.0, 1.0)\ndouble r = dis(gen);\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Ch3 id=\"正态分布-高斯分布\">正态分布（高斯分布）\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-cpp\">\u002F\u002F 均值 0，标准差 1\nstd::normal_distribution<double> dis(0.0, 1.0);\ndouble r = dis(gen);\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Cp>适用于模拟噪声、物理量波动等场景。\u003C\u002Fp>\n\u003Ch3 id=\"伯努利分布-抛硬币\">伯努利分布（抛硬币）\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-cpp\">\u002F\u002F 70% 概率为 true\nstd::bernoulli_distribution dis(0.7);\nbool result = dis(gen);\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Ch3 id=\"泊松分布\">泊松分布\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-cpp\">\u002F\u002F 平均每分钟 4 次事件\nstd::poisson_distribution<int> dis(4.0);\nint events = dis(gen);\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Ch3 id=\"离散分布-自定义权重\">离散分布（自定义权重）\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-cpp\">\u002F\u002F 三个选项，权重分别为 1, 2, 3（概率 1\u002F6, 2\u002F6, 3\u002F6）\nstd::discrete_distribution<int> dis({1, 2, 3});\nint choice = dis(gen); \u002F\u002F 返回 0, 1 或 2\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Chr>\n\u003Ch2 id=\"线程安全注意事项\">线程安全注意事项\u003C\u002Fh2>\n\u003Cp>\u003Ccode>mt19937\u003C\u002Fcode> 和分布对象\u003Cstrong>都不是线程安全的\u003C\u002Fstrong>，不能在多线程中共享。\u003C\u002Fp>\n\u003Ch3 id=\"方案一-每线程独立引擎-推荐\">方案一：每线程独立引擎（推荐）\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-cpp\">#include <thread>\n#include <random>\n\nvoid worker(int thread_id) {\n    \u002F\u002F 每个线程独立的引擎，用线程 id 区分种子\n    std::random_device rd;\n    std::mt19937 gen(rd() ^ (thread_id * 0x12345678));\n    std::uniform_int_distribution<int> dis(1, 100);\n    \n    for (int i = 0; i < 10; ++i) {\n        std::cout << dis(gen) << " ";\n    }\n}\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Ch3 id=\"方案二-thread_local-存储\">方案二：thread_local 存储\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-cpp\">thread_local std::mt19937 gen(std::random_device{}());\n\nint random_int(int lo, int hi) {\n    std::uniform_int_distribution<int> dis(lo, hi);\n    return dis(gen);\n}\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Cp>\u003Ccode>thread_local\u003C\u002Fcode> 让每个线程拥有自己的 \u003Ccode>gen\u003C\u002Fcode> 实例，安全且高效。\u003C\u002Fp>\n\u003Ch3 id=\"方案三-互斥锁-不推荐-性能差\">方案三：互斥锁（不推荐，性能差）\u003C\u002Fh3>\n\u003Cpre>\u003Ccode class=\"language-cpp\">std::mutex mtx;\nstd::mt19937 gen(std::random_device{}());\n\nint random_int_safe(int lo, int hi) {\n    std::lock_guard<std::mutex> lock(mtx);\n    std::uniform_int_distribution<int> dis(lo, hi);\n    return dis(gen);\n}\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Chr>\n\u003Ch2 id=\"完整工具函数示例\">完整工具函数示例\u003C\u002Fh2>\n\u003Cpre>\u003Ccode class=\"language-cpp\">#include <random>\n#include <stdexcept>\n\n\u002F\u002F 线程安全的随机工具（thread_local 方案）\nnamespace rng {\n\n\u002F\u002F 获取线程本地引擎\ninline std::mt19937& engine() {\n    thread_local std::mt19937 gen(std::random_device{}());\n    return gen;\n}\n\n\u002F\u002F 生成整数 [lo, hi]\ninline int randint(int lo, int hi) {\n    if (lo > hi) throw std::invalid_argument("lo > hi");\n    std::uniform_int_distribution<int> dis(lo, hi);\n    return dis(engine());\n}\n\n\u002F\u002F 生成浮点数 [lo, hi)\ninline double randf(double lo = 0.0, double hi = 1.0) {\n    std::uniform_real_distribution<double> dis(lo, hi);\n    return dis(engine());\n}\n\n\u002F\u002F 以概率 p 返回 true\ninline bool chance(double p) {\n    std::bernoulli_distribution dis(p);\n    return dis(engine());\n}\n\n} \u002F\u002F namespace rng\n\n\u002F\u002F 使用\nint main() {\n    for (int i = 0; i < 10; ++i) {\n        std::cout << rng::randint(1, 6) << " "; \u002F\u002F 模拟骰子\n    }\n    std::cout << "\\n";\n    \n    if (rng::chance(0.3)) {\n        std::cout << "30% 概率触发！\\n";\n    }\n    \n    return 0;\n}\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Chr>\n\u003Ch2 id=\"小结\">小结\u003C\u002Fh2>\n\u003Ctable>\n\u003Cthead>\n\u003Ctr>\n\u003Cth>对比项\u003C\u002Fth>\n\u003Cth>\u003Ccode>rand()\u003C\u002Fcode>\u003C\u002Fth>\n\u003Cth>\u003Ccode><random>\u003C\u002Fcode>\u003C\u002Fth>\n\u003C\u002Ftr>\n\u003C\u002Fthead>\n\u003Ctbody>\n\u003Ctr>\n\u003Ctd>分布质量\u003C\u002Ftd>\n\u003Ctd>差\u003C\u002Ftd>\n\u003Ctd>高（可选）\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>指定分布\u003C\u002Ftd>\n\u003Ctd>需手动换算\u003C\u002Ftd>\n\u003Ctd>内置多种分布\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>线程安全\u003C\u002Ftd>\n\u003Ctd>否\u003C\u002Ftd>\n\u003Ctd>手动管理（thread_local）\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>种子质量\u003C\u002Ftd>\n\u003Ctd>差（time）\u003C\u002Ftd>\n\u003Ctd>好（random_device）\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003Ctr>\n\u003Ctd>可读性\u003C\u002Ftd>\n\u003Ctd>低\u003C\u002Ftd>\n\u003Ctd>高\u003C\u002Ftd>\n\u003C\u002Ftr>\n\u003C\u002Ftbody>\n\u003C\u002Ftable>\n\u003CChart client:only=\"vue\" type=\"radar\" data={randRadarData} options={randRadarOptions} height={260} \u002F>\n\u003Cp>从 C++11 开始，\u003Ccode><random>\u003C\u002Fcode> 已经完全可以替代 \u003Ccode>rand()\u003C\u002Fcode>。下次写随机数相关代码时，记得用 \u003Ccode>mt19937\u003C\u002Fcode> + 对应分布，彻底告别那个"能用但很糟"的老朋友。\u003C\u002Fp>\n","2023-05-26",[11,12,13],"cpp","c++11","random",false,[16,29,40,52,62,69,76,83,90,97,107,116,126,135,143,151,160,169,178,188,195,204,210,217,223,232,239,246,254,264,273,282,292,302,312,320,330,341,351,360,367,373,376,384,392,400,408,415],{"slug":17,"title":18,"description":19,"pub_date":20,"tags":21,"draft":14,"word_count":28},"ide-skills-guide","Agent Skills 完全指南：21 款第三方 Skill 深度评测与使用心得","全面评测 21 款第三方 Agent Skills，涵盖 Vue 生态、前端设计、构建工具、实用工具四大分类。从安装配置到实际使用场景，带你了解每个 Skill 的功能特点、最佳实践与使用心得。","2026-06-15",[22,23,24,25,26,27],"agent","skills","AI","效率工具","前端","Vue",4169,{"slug":30,"title":31,"description":32,"pub_date":33,"tags":34,"draft":14,"word_count":39},"linux-kernel-skeleton-struct-funcptr-container_of","Linux 内核骨架：struct、函数指针与 container_of","读懂 Linux 内核源码的三件套：巨大的 struct 组合代替继承、函数指针表实现虚派发、container_of 宏从嵌入成员找回完整对象。","2026-05-09",[35,36,37,38],"linux","kernel","C","container_of",1369,{"slug":41,"title":42,"description":43,"pub_date":44,"tags":45,"draft":14,"word_count":51},"astro-complete-guide-2025","Astro 5 深度剖析：Islands 架构原理、构建优化与 Cloudflare Workers 边缘部署","从编译器视角解析 Astro 5 的 Islands 架构实现原理，Content Layer API 的 Vite 插件机制，Server Islands 的流式渲染，以及如何在 Cloudflare Workers + D1 边缘环境下榨干性能。","2026-05-08",[46,47,48,49,50],"astro","frontend","cloudflare","performance","architecture",3663,{"slug":53,"title":54,"description":55,"pub_date":56,"tags":57,"draft":14,"word_count":61},"llm-prompt-engineering","Prompt Engineering 实战：让 LLM 真正听话的技巧","System prompt 怎么写、Few-shot 怎么设计、Chain-of-Thought 原理，以及常见失败模式和调试方法。","2026-05-03",[58,59,60],"ai","llm","工程实践",1723,{"slug":63,"title":64,"description":65,"pub_date":56,"tags":66,"draft":14,"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":56,"tags":73,"draft":14,"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":56,"tags":80,"draft":14,"word_count":82},"docker-practical-guide","Docker 实战：从会用到用好","会 docker run 不够，Dockerfile 最佳实践、多阶段构建、Compose 编排、镜像瘦身才是日常真正需要的。",[81,35,60],"docker",1268,{"slug":84,"title":85,"description":86,"pub_date":56,"tags":87,"draft":14,"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,22,23],"Claude",2090,{"slug":91,"title":92,"description":93,"pub_date":56,"tags":94,"draft":14,"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":56,"tags":101,"draft":14,"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":56,"tags":111,"draft":14,"word_count":115},"linux-performance-tuning","Linux 性能调优实战：从 top 到 perf 的完整工具链","遇到性能问题不知道从哪下手？这篇建立系统化的排查思路，从 CPU\u002F内存\u002FIO\u002F网络逐层分析。",[35,112,113,114],"性能","运维","系统编程",1524,{"slug":117,"title":118,"description":119,"pub_date":56,"tags":120,"draft":14,"word_count":125},"python-functional-programming","Python 函数式编程：map\u002Ffilter\u002Freduce 之外","Python 不是纯函数式语言，但 functools、itertools、偏函数、闭包这些工具用好了能让代码简洁一个量级。",[121,122,123,124],"python","函数式","闭包","装饰器",1867,{"slug":127,"title":128,"description":129,"pub_date":56,"tags":130,"draft":14,"word_count":134},"python-oop-guide","Python 面向对象：__init__ 之外你需要知道的","Python OOP 不只是 class + __init__，魔术方法、描述符、元类才是真正的武器。",[121,131,132,133],"OOP","面向对象","魔术方法",1792,{"slug":136,"title":137,"description":138,"pub_date":56,"tags":139,"draft":14,"word_count":142},"python-data-structures","Python 内置数据结构深度解析","list、dict、set、tuple 不只是数据容器，搞懂它们的底层实现和时间复杂度，才能写出高性能 Python。",[121,140,112,141],"数据结构","算法",1517,{"slug":144,"title":145,"description":146,"pub_date":56,"tags":147,"draft":14,"word_count":150},"python-basics-quick-start","Python 快速上手：写给有编程基础的人","已经会其他语言，想快速掌握 Python 的语法特性和思维方式，这篇是捷径。",[121,148,149],"入门","基础",1607,{"slug":152,"title":153,"description":154,"pub_date":56,"tags":155,"draft":14,"word_count":159},"python-dataclass-pydantic","Python dataclass vs Pydantic：数据类选型指南","dataclass 是标准库的轻量选择，Pydantic v2 是带验证的重武器，什么时候用哪个，这篇说清楚。",[121,156,157,158],"dataclass","pydantic","数据验证",1323,{"slug":161,"title":162,"description":163,"pub_date":56,"tags":164,"draft":14,"word_count":168},"python-asyncio-practical","Python asyncio 实战：从回调地狱到协程优雅","asyncio 是 Python 异步编程的核心，搞懂 event loop、Task、gather 这些概念才能写出真正高效的异步代码。",[121,165,166,167],"asyncio","并发","网络编程",1258,{"slug":170,"title":171,"description":172,"pub_date":56,"tags":173,"draft":14,"word_count":177},"python-type-hints-guide","Python 类型注解完全指南：从入门到实践","Python 3.5+ 引入类型注解，配合 mypy\u002Fpyright 让 Python 也能享受静态类型检查的好处。",[121,174,175,176],"typescript-style","type-hints","工具链",1102,{"slug":179,"title":180,"description":181,"pub_date":182,"tags":183,"draft":14,"word_count":187},"pwa-install-update-button","PWA 踩坑：为什么安装按钮从来不出现","从 beforeinstallprompt 到 Service Worker waiting，把 PWA 的安装与更新提示真正做对","2026-05-02",[184,185,186],"pwa","javascript","web",1683,{"slug":189,"title":190,"description":191,"pub_date":192,"tags":193,"draft":14,"word_count":194},"openclaw-vs-hermes-agent","OpenClaw vs Hermes Agent：两个本地优先 Agent 的设计差异","OpenClaw（Novita AI）和 Hermes Agent（Nous Research）都是本地运行的个人 AI Agent，但在记忆系统、技能学习、运行环境和模型生态上走了不同的路。深入对比两种架构的核心差异。","2026-05-01",[58,22,59],1679,{"slug":196,"title":197,"description":198,"pub_date":192,"tags":199,"draft":14,"word_count":203},"cpp-random-design-patterns","C++ 设计模式实战：RAII、观察者、工厂","用现代 C++（C++17\u002F20）实现三种高频设计模式：RAII 资源管理、观察者模式事件系统、工厂模式插件架构。每种模式给出问题场景、实现代码和真实工程案例。",[11,200,201,202],"设计模式","c++17","工程",2613,{"slug":205,"title":206,"description":207,"pub_date":192,"tags":208,"draft":14,"word_count":209},"data-structures-fundamentals","数据结构基础：从数组到红黑树","系统梳理常用数据结构的核心原理、时间复杂度和适用场景。数组、链表、栈、队列、哈希表、二叉树、堆、图，每种结构附实现要点和 C++ 代码片段。",[140,141,11,149],3004,{"slug":211,"title":212,"description":213,"pub_date":214,"tags":215,"draft":14,"word_count":216},"ai-agent-what-is","什么是 AI Agent？从 LLM 到自主执行","LLM 本身是无状态问答机，Agent 是什么让它’动’起来的？本文深入解析 Agent 的四个核心能力、ReAct 框架、工具调用原理，以及主流框架横向对比。","2026-04-30",[58,22,59],2116,{"slug":218,"title":219,"description":220,"pub_date":214,"tags":221,"draft":14,"word_count":222},"ai-agent-memory","AI Agent 的记忆系统：从上下文窗口到长期记忆","深入拆解 AI Agent 的四种记忆类型、上下文窗口压缩策略、RAG 向量检索原理，以及三种典型失败模式和工程选型建议。",[58,22,67],2052,{"slug":224,"title":225,"description":226,"pub_date":214,"tags":227,"draft":14,"word_count":231},"network-proxy-vpn-guide","代理与翻墙技术原理：从 HTTP 代理到现代协议","深入解析代理与 VPN 的本质区别，梳理从 SOCKS5 到 Shadowsocks、V2Ray\u002FXray、Hysteria2 的协议演进，以及机场订阅的技术本质。",[228,229,230],"网络","代理","协议",2148,{"slug":233,"title":234,"description":235,"pub_date":214,"tags":236,"draft":14,"word_count":150},"algorithm-binary-search","二分查找：永远写不对？记住这个模板","彻底搞清楚二分查找的边界问题：闭区间和左闭右开两套模板、三道经典 LeetCode 题目完整 C++ 实现，以及二分答案的进阶思路。",[141,237,238,11],"二分查找","leetcode",{"slug":240,"title":241,"description":242,"pub_date":214,"tags":243,"draft":14,"word_count":245},"algorithm-sliding-window","滑动窗口算法：从暴力到 O(n) 的思维跃迁","系统讲解滑动窗口算法的核心模板、适用题型，配合三道经典 LeetCode 题目的完整 C++ 实现，彻底理解双指针收缩思路。",[141,244,238,11],"滑动窗口",1943,{"slug":247,"title":248,"description":249,"pub_date":214,"tags":250,"draft":14,"word_count":253},"network-clash-config","Clash \u002F Mihomo 配置详解：规则、策略组与分流","深入解析 Clash\u002FMihomo 的核心配置结构，包括代理节点、策略组类型、规则优先级、DNS fake-ip 模式，以及一份实用的完整配置模板。",[228,251,229,252],"clash","配置",1292,{"slug":255,"title":256,"description":257,"pub_date":258,"tags":259,"draft":14,"word_count":263},"hid-hotplug","HID 设备热插拔检测：从 udev 到 node-hid","在 Linux 上用 node-hid + usb 库实现可靠的 USB HID 设备热插拔检测，踩坑记录","2026-04-28",[11,260,35,261,262],"hid","nodejs","electron",2039,{"slug":265,"title":266,"description":267,"pub_date":268,"tags":269,"draft":14,"word_count":272},"electron-ipc-types","Electron IPC 类型安全：从 any 到完全类型化","用 TypeScript 泛型封装 Electron IPC，彻底消灭 any，preload 契约集中管理","2026-04-25",[262,102,270,271],"ipc","vue",1446,{"slug":274,"title":275,"description":276,"pub_date":277,"tags":278,"draft":14,"word_count":281},"element-plus-popover-hide","手动关闭多个 el-popover（不用 v-model:visible）","通过 ref + Reflect.get 调用 hide() 方法手动关闭 Element Plus Popover，解释 Vue3 Proxy 导致无法直接调用实例方法的原因。","2024-10-25",[271,279,280],"element-plus","vue3",1321,{"slug":283,"title":284,"description":285,"pub_date":286,"tags":287,"draft":14,"word_count":291},"vite-vue3-ts-elementplus-pinia","用 Vite+（vp）从零搭建 Vue3 + TypeScript + Element Plus + Pinia + Vue Router","使用 Vite+ 统一工具链（vp）一条命令搭建 Vue3 全家桶，涵盖按需导入、Pinia store、路由配置，以及常见坑的解决方案。","2024-08-27",[271,288,102,279,289,290],"vite","pinia","vite-plus",1960,{"slug":293,"title":294,"description":295,"pub_date":296,"tags":297,"draft":14,"word_count":301},"cef-lnk2038-iterator-debug-level","CEF LNK2038：解决 _ITERATOR_DEBUG_LEVEL 不匹配错误","分析 CEF（Chromium Embedded Framework）集成时出现的 LNK2038 _ITERATOR_DEBUG_LEVEL 链接错误，从根本原因到解决方案的完整指南。","2024-05-07",[11,298,299,300],"CEF","Visual Studio","链接错误",1509,{"slug":303,"title":304,"description":305,"pub_date":306,"tags":307,"draft":14,"word_count":311},"npm-electron-install-fix","彻底解决 npm 安装 Electron 失败的问题","分析 npm install electron 失败的根本原因（下载二进制超时\u002F被墙），通过国内镜像（npmmirror）彻底解决，并介绍多种备选方案和常见错误排查。","2024-03-01",[262,308,309,310],"npm","前端工具链","国内镜像",1494,{"slug":313,"title":314,"description":315,"pub_date":316,"tags":317,"draft":14,"word_count":319},"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,35,318],"工具",2244,{"slug":321,"title":322,"description":323,"pub_date":324,"tags":325,"draft":14,"word_count":329},"vmware-tools-install","在 VMware 虚拟机中安装 open-vm-tools 完整指南","详解 VMware Tools 的作用、open-vm-tools 与官方 VMware Tools 的区别，以及在 Ubuntu 虚拟机中安装并生效的完整步骤和常见问题排查。","2023-11-21",[326,35,327,328],"VMware","Ubuntu","虚拟机",2523,{"slug":331,"title":332,"description":333,"pub_date":334,"tags":335,"draft":14,"word_count":340},"load-balancing-algorithms","负载均衡算法完全指南：从轮询到一致性哈希","系统梳理静态与动态负载均衡算法，涵盖轮询、随机、权重、IP Hash、一致性 Hash、最少连接、最快响应等，并对比 Nginx、Dubbo、Spring Cloud LoadBalancer 的实现差异。","2023-11-15",[336,337,338,339],"分布式","负载均衡","Nginx","微服务",1764,{"slug":342,"title":343,"description":344,"pub_date":345,"tags":346,"draft":14,"word_count":350},"win-cw2a-ca2w","ATL 字符串转换：CW2A 与 CA2W 完全指南","详解 ATL 宏 CW2A\u002FCA2W 在 Unicode 与 ANSI 之间的字符串转换用法、头文件依赖、USES_CONVERSION 宏的作用与常见陷阱。","2023-06-09",[11,347,348,349],"windows","ATL","字符串",1665,{"slug":352,"title":353,"description":354,"pub_date":345,"tags":355,"draft":14,"word_count":359},"csharp-sendmessage-cpp","C# 通过 SendMessage 向 C++ 窗口发送消息与字符串","使用 P\u002FInvoke 调用 user32.dll 的 SendMessage，从 C# 发送自定义 WM_USER 消息及字符串指针给 C++ 原生窗口，并在 C++ 侧正确接收和转换。",[356,11,347,357,358],"C#","互操作","PInvoke",1554,{"slug":361,"title":362,"description":363,"pub_date":9,"tags":364,"draft":14,"word_count":366},"win-postmessage-vector","Windows PostMessage 跨线程传递 std::vector 指针","通过 PostMessage 在 Windows 消息队列中传递 std::vector 指针，使用 reinterpret_cast 将指针装入 LPARAM，并在接收方正确释放内存。",[11,347,365],"WinAPI",1823,{"slug":368,"title":369,"description":370,"pub_date":9,"tags":371,"draft":14,"word_count":372},"exe-dll-single-package","将 EXE 和 DLL 打包成单一可执行文件","介绍两种将 exe 和依赖 dll 打包成单文件的方案：Enigma Virtual Box 和 WinRAR 自解压，适合发布 Windows 桌面程序时简化分发流程。",[347,11,318],1619,{"slug":4,"title":5,"description":6,"pub_date":9,"tags":374,"draft":14,"word_count":375},[11,12,13],1549,{"slug":377,"title":378,"description":379,"pub_date":380,"tags":381,"draft":14,"word_count":383},"win-startup-registry","C++ 实现程序开机自启动：注册表方式详解","通过操作 Windows 注册表 Run 键实现程序开机自启动，包括 HKCU 与 HKLM 区别、完整封装代码、工作目录问题和 UAC 权限处理。","2022-12-26",[347,11,382],"registry",1201,{"slug":385,"title":386,"description":387,"pub_date":388,"tags":389,"draft":14,"word_count":391},"mfc-cstring-wparam","MFC 中 CString 与 WPARAM 之间的转换","详解 MFC 消息传递中 CString 无法直接强转为 WPARAM 的原因，以及两种正确的转换方案，并介绍结构体指针传递的正确姿势。","2022-11-25",[390,11,347],"mfc",1546,{"slug":393,"title":394,"description":395,"pub_date":396,"tags":397,"draft":14,"word_count":399},"duilib-static-build","正确编译 Duilib 静态库：避免 ATL 依赖和链接错误","详解如何用 DuiLib_Static.vcxproj 编译 Duilib 静态库，解决 VARIANT 未定义、Unicode 配置不匹配和 ATL 依赖等常见问题。","2022-08-24",[11,398,347,390],"duilib",2639,{"slug":401,"title":402,"description":403,"pub_date":404,"tags":405,"draft":14,"word_count":407},"mfc-dpi-adaptive","MFC 界面自适应不同分辨率","MFC 对话框程序实现控件和字体随分辨率自动缩放的完整方案，附 DPI Awareness 配置说明","2022-08-17",[390,11,347,406],"dpi",1414,{"slug":409,"title":410,"description":411,"pub_date":412,"tags":413,"draft":14,"word_count":414},"mfc-drag-window","MFC 无标题栏窗口客户区拖动：三种方法对比","MFC 对话框去掉标题栏后如何实现拖动移动窗口，三种方案完整实现与适用场景分析","2022-08-16",[390,11,347],1633,{"slug":416,"title":417,"description":418,"pub_date":419,"tags":420,"draft":14,"word_count":422},"algorithm-number-complement","整数的补数：位运算掩码解法","LeetCode 476 题，用掩码 XOR 实现整数补数，附 C++\u002FPython\u002FJava 三种实现及补数与补码的区别","2021-03-08",[141,421,238],"位运算",1374,[]]