[{"data":1,"prerenderedAt":1890},["ShallowReactive",2],{"blog-taxonomies":3,"blog-stats":507,"post-数据结构\u002F数据结构-算法复杂度":1083},[4,11,16,21,25,29,36,39,44,47,52,58,63,66,71,76,80,84,87,93,96,101,105,110,113,117,122,127,132,136,141,143,146,151,155,157,162,165,169,173,176,179,183,186,190,193,197,200,205,208,211,214,219,222,228,234,237,239,245,249,253,256,260,266,271,276,281,283,287,290,293,298,301,304,306,308,311,314,316,318,321,327,332,337,342,347,352,354,356,358,361,365,367,369,371,374,376,378,381,386,390,393,396,400,404,407,411,413,415,417,421,423,425,428,431,433,435,437,439,441,443,446,448,450,454,456,459,461,463,465,467,469,471,473,477,483,486,488,491,493,495,497,499,501,503,505],{"category":5,"tags":6},"笔记",[7,8,9,10],"QQ","插件","LiteLoader","美化",{"category":12,"tags":13},"其他",[14,15,10],"博客","IP签名",{"category":17,"tags":18},"杂谈",[19,20],"互联网","观点",{"category":5,"tags":22},[14,23,24],"GitHub","数据可视化",{"category":5,"tags":26},[14,27,28],"访问统计","不蒜子",{"category":30,"tags":31},"工具",[32,33,34,35],"Python","爬虫","选课脚本","广州大学",{"category":5,"tags":37},[38,5],"数学分析",{"category":40,"tags":41},"算法",[42,40,43],"数据结构","线性表",{"category":40,"tags":45},[42,46],"复习",{"category":5,"tags":48},[49,50,51],"高等代数","线性代数","知识点",{"category":5,"tags":53},[14,54,55,56,57],"Typora","PicGo","图床","Markdown",{"category":30,"tags":59},[60,61,62],"Jupyter","工具配置","中文",{"category":30,"tags":64},[65,61,10],"VSCode",{"category":30,"tags":67},[68,69,70,35],"路由器","OpenWrt","校园网",{"category":12,"tags":72},[73,74,75],"网络协议","Wireshark","DEVP2P",{"category":5,"tags":77},[73,74,78,79],"Lua","解码器",{"category":5,"tags":81},[82,5,83],"常微分方程","数学",{"category":5,"tags":85},[86,5,83],"概率论",{"category":30,"tags":88},[89,90,91,92],"Docker","WSL","Windows","磁盘清理",{"category":30,"tags":94},[32,33,95,35],"课程表",{"category":5,"tags":97},[14,98,99,100],"Hexo","Gitalk","评论系统",{"category":5,"tags":102},[14,103,98,104],"Obsidian","写作工具",{"category":12,"tags":106},[107,108,109],"课题研究","泊松分布","参数估计",{"category":12,"tags":111},[107,108,109,112],"组会",{"category":12,"tags":114},[109,115,108,116],"IM模型","统计学",{"category":17,"tags":118},[119,120,121],"软考","网络规划","信息系统项目管理",{"category":30,"tags":123},[124,125,126],"Arch Linux","AppImage","Linux",{"category":5,"tags":128},[129,130,131],"编程语言","计算机科学","内存管理",{"category":5,"tags":133},[134,135],"Canvas","前端",{"category":5,"tags":137},[14,138,139,140],"GitHub Actions","Vite","部署",{"category":5,"tags":142},[135],{"category":5,"tags":144},[135,145],"系统设计",{"category":5,"tags":147},[135,148,149,150],"安全","XSS","CSRF",{"category":152,"tags":153},"项目",[134,154],"PixiJS",{"category":152,"tags":156},null,{"category":40,"tags":158},[42,159,160,161],"栈","队列","JavaScript",{"category":40,"tags":163},[42,164,161],"哈希表",{"category":5,"tags":166},[167,161,168],"ES6","Set",{"category":40,"tags":170},[40,171,172],"动态规划","背包问题",{"category":40,"tags":174},[40,175],"滑动窗口",{"category":40,"tags":177},[42,178,161],"链表",{"category":40,"tags":180},[40,181,161,182],"ACM","面试",{"category":40,"tags":184},[40,161,185],"数据类型转换",{"category":40,"tags":187},[42,188,178,189],"顺序表","TypeScript",{"category":5,"tags":191},[135,154,134,192],"渲染",{"category":5,"tags":194},[135,195,134,196],"富文本编辑","wangEditor",{"category":40,"tags":198},[199,40,178],"力扣",{"category":5,"tags":201},[202,203,204,91],"DNS","加密","网络安全",{"category":5,"tags":206},[135,207],"Axios",{"category":5,"tags":209},[135,207,189,210],"接口封装",{"category":5,"tags":212},[135,213,145],"JWT",{"category":152,"tags":215},[134,216,217,154,218],"画布","React","项目开发",{"category":17,"tags":220},[221],"日志",{"category":5,"tags":223},[224,225,226,227],"Neo4j","图数据库","中心度分析","PageRank",{"category":12,"tags":229},[230,231,232,233],"论文","机器学习","随机森林","保险欺诈",{"category":5,"tags":235},[236],"人工智能",{"category":5,"tags":238},[231,40,32],{"category":12,"tags":240},[241,242,243,244],"共识算法","最长链","区块链","算法设计",{"category":5,"tags":246},[161,247,248,135],"闭包","作用域",{"category":5,"tags":250},[14,138,251,252],"RSS","自动化",{"category":30,"tags":254},[89,90,91,255],"安装",{"category":30,"tags":257},[258,91,259],"MSYS2","开发环境",{"category":5,"tags":261},[262,263,264,265],"团队协作","Git","Commit规范","代码审查",{"category":30,"tags":267},[268,269,270],"oh-my-posh","终端美化","CLI",{"category":5,"tags":272},[273,274,275],"上下文工程","Agent","RAG",{"category":5,"tags":277},[278,279,280],"前端工程化","技术选型","工程基建",{"category":5,"tags":282},[275],{"category":5,"tags":284},[285,286],"SDD","规格驱动开发",{"category":5,"tags":288},[289],"neovim",{"category":5,"tags":291},[292],"技术写作",{"category":5,"tags":294},[295,32,296,89,297],"FastAPI","后端","工程实践",{"category":152,"tags":299},[274,300],"Harness Engineering",{"category":5,"tags":302},[303],"RFC",{"category":152,"tags":305},[274,300,275],{"category":152,"tags":307},[274],{"category":40,"tags":309},[199,40,161,310],"两数之和",{"category":40,"tags":312},[199,40,161,313],"双指针",{"category":40,"tags":315},[199,40,161,178],{"category":40,"tags":317},[199,40,161,175],{"category":40,"tags":319},[199,40,161,320],"回溯",{"category":5,"tags":322},[323,324,325,326],"分布式处理与计算","Spark","Scala","RDD",{"category":5,"tags":328},[323,329,330,331],"线性回归","逻辑回归","监督学习",{"category":5,"tags":333},[323,334,335,336],"数值优化","牛顿法","收敛性",{"category":5,"tags":338},[323,339,340,341],"PCA","数据降维","正则化",{"category":5,"tags":343},[323,344,345,346],"聚类","层次聚类","K-Means",{"category":5,"tags":348},[323,349,350,351],"随机模拟","统计推断","EM算法",{"category":5,"tags":353},[24],{"category":5,"tags":355},[24],{"category":5,"tags":357},[24],{"category":40,"tags":359},[42,360],"图论",{"category":40,"tags":362},[42,363,364],"树","二叉树",{"category":40,"tags":366},[42,160],{"category":40,"tags":368},[42],{"category":40,"tags":370},[42,159],{"category":40,"tags":372},[42,40,373],"复杂度分析",{"category":40,"tags":375},[42,43,178],{"category":40,"tags":377},[42,43,188],{"category":40,"tags":379},[42,380],"基础概念",{"category":17,"tags":382},[383,384,385],"随记","照片","高中",{"category":17,"tags":387},[383,388,389],"团建","战地",{"category":17,"tags":391},[383,392],"生活",{"category":17,"tags":394},[383,395],"文学",{"category":17,"tags":397},[383,398,399],"SCP","模因",{"category":17,"tags":401},[383,402,403],"画集","艺术",{"category":17,"tags":405},[14,406,383],"写作",{"category":17,"tags":408},[383,409,410],"音乐","摇滚",{"category":17,"tags":412},[383,392],{"category":17,"tags":414},[383,409],{"category":17,"tags":416},[383,35,392],{"category":17,"tags":418},[383,419,420],"同人","手书",{"category":17,"tags":422},[383,392],{"category":17,"tags":424},[383,392],{"category":17,"tags":426},[383,427],"植物",{"category":17,"tags":429},[383,430],"读书",{"category":17,"tags":432},[383,392],{"category":17,"tags":434},[383,392],{"category":17,"tags":436},[383,392],{"category":17,"tags":438},[383,392],{"category":17,"tags":440},[383,392],{"category":17,"tags":442},[383,392],{"category":17,"tags":444},[14,445,383],"一周年",{"category":17,"tags":447},[383,392],{"category":17,"tags":449},[383,392],{"category":17,"tags":451},[35,452,453],"开源组织","SITE-193",{"category":17,"tags":455},[383,392],{"category":17,"tags":457},[383,458],"年末",{"category":17,"tags":460},[383,392],{"category":17,"tags":462},[383,392],{"category":17,"tags":464},[14,17],{"category":17,"tags":466},[383,392],{"category":17,"tags":468},[383,392],{"category":17,"tags":470},[383,392],{"category":17,"tags":472},[383,392],{"category":17,"tags":474},[383,475,476],"游戏","Control",{"category":30,"tags":478},[479,480,481,482],"Quadim","图像处理","四叉树","Rust",{"category":17,"tags":484},[14,485],"上线纪念",{"category":17,"tags":487},[383,395],{"category":30,"tags":489},[203,490],"测试",{"category":17,"tags":492},[383],{"category":17,"tags":494},[383,392],{"category":17,"tags":496},[383],{"category":5,"tags":498},[40],{"category":5,"tags":500},[40],{"category":5,"tags":502},[40],{"category":5,"tags":504},[40],{"category":5,"tags":506},[40],[508,512,516,520,524,528,532,536,540,544,548,552,556,560,564,568,572,576,579,583,587,590,594,598,602,606,610,614,618,622,626,630,634,638,642,646,650,654,658,662,666,670,674,678,682,686,690,694,698,702,706,710,714,718,722,726,730,734,738,742,746,750,754,758,762,766,770,774,778,782,786,790,794,798,801,805,809,813,817,821,825,829,833,837,841,845,849,853,857,861,865,869,873,877,881,885,889,893,897,901,904,907,911,915,919,923,927,930,934,938,942,946,950,954,957,961,965,969,973,977,981,984,988,992,996,1000,1004,1007,1011,1015,1019,1023,1027,1031,1035,1039,1043,1047,1051,1055,1059,1063,1067,1071,1075,1079],{"path":509,"words":510,"published":511,"date":156},"\u002Fposts\u002F2024\u002F2024-06-25-liteloaderqqnt",1296,"2024-06-25 11:03:08",{"path":513,"words":514,"published":515,"date":156},"\u002Fposts\u002F2024\u002F2024-06-26-ip签名",0,"2024-06-26 22:53:53",{"path":517,"words":518,"published":519,"date":156},"\u002Fposts\u002F2024\u002F2024-06-29-何加盐中文互联网正在加速崩塌",4853,"2024-06-29 00:47:13",{"path":521,"words":522,"published":523,"date":156},"\u002Fposts\u002F2024\u002F2024-07-12-github-chart",270,"2024-07-12 20:02:50",{"path":525,"words":526,"published":527,"date":156},"\u002Fposts\u002F2024\u002F2024-07-14-访客数统计",192,"2024-07-24 01:34:28",{"path":529,"words":530,"published":531,"date":156},"\u002Fposts\u002F2024\u002F2024-07-26-广大选课脚本",110,"2024-07-26 01:34:28",{"path":533,"words":534,"published":535,"date":156},"\u002Fposts\u002F2024\u002F2024-07-26-数学分析笔记其二",14,"2024-07-26 23:54:02",{"path":537,"words":538,"published":539,"date":156},"\u002Fposts\u002F2024\u002F2024-07-26-数据结构复习其二",12856,"2024-07-26 02:48:08",{"path":541,"words":542,"published":543,"date":156},"\u002Fposts\u002F2024\u002F2024-07-26-数据结构复习相关",32856,"2024-07-26 02:24:14",{"path":545,"words":546,"published":547,"date":156},"\u002Fposts\u002F2024\u002F2024-07-26-线性代数与空间解析几何知识点全汇总",6110,"2024-07-26 03:27:55",{"path":549,"words":550,"published":551,"date":156},"\u002Fposts\u002F2024\u002F2024-07-31-typora-picgo-兰空图床打造markdown写作环境",311,"2024-07-31 12:56:23",{"path":553,"words":554,"published":555,"date":156},"\u002Fposts\u002F2024\u002F2024-09-02-jupyter配置中文",441,"2024-09-02 23:49:05",{"path":557,"words":558,"published":559,"date":156},"\u002Fposts\u002F2024\u002F2024-09-02-自定义vscode背景图片",100,"2024-09-02 23:39:00",{"path":561,"words":562,"published":563,"date":156},"\u002Fposts\u002F2024\u002F2024-09-03-制作gzhu校园网路由器",1423,"2024-09-03 23:43:18",{"path":565,"words":566,"published":567,"date":156},"\u002Fposts\u002F2024\u002F2024-09-26-09-25-2024",136,"2024-09-26 00:49:26",{"path":569,"words":570,"published":571,"date":156},"\u002Fposts\u002F2024\u002F2024-11-04-创建一个网络包解码器分析devp2p协议",1943,"2024-11-04 16:45:19",{"path":573,"words":574,"published":575,"date":156},"\u002Fposts\u002F2024\u002F2025-03-09-2024一些笔记常微分",16,"2024-12-09 22:51:00",{"path":577,"words":574,"published":578,"date":156},"\u002Fposts\u002F2024\u002F2025-03-09-2024一些笔记概率论","2025-03-09 22:51:00",{"path":580,"words":581,"published":582,"date":156},"\u002Fposts\u002F2025\u002F2025-03-01-windows下释放docker占用的wsl空间",164,"2025-03-01 13:54:15",{"path":584,"words":585,"published":586,"date":156},"\u002Fposts\u002F2025\u002F2025-03-01-爬虫实战-爬取广州大学课程表",774,"2025-03-01 14:55:48",{"path":588,"words":530,"published":589,"date":156},"\u002Fposts\u002F2025\u002F2025-04-03-hexo集成gitalk的问题","2025-04-03 14:26:34",{"path":591,"words":592,"published":593,"date":156},"\u002Fposts\u002F2025\u002F2025-09-22-记一次配置obsidian配合hexo写博客",92,"2025-09-22 16:47:52",{"path":595,"words":596,"published":597,"date":156},"\u002Fposts\u002F2025\u002F2025-10-24-10-20课题",204,"2025-10-24 08:15:01",{"path":599,"words":600,"published":601,"date":156},"\u002Fposts\u002F2025\u002F2025-11-02-组会朝花夕拾",501,"2025-11-02 18:56:59",{"path":603,"words":604,"published":605,"date":156},"\u002Fposts\u002F2025\u002F2025-11-05-基于随机加权推断模型im的参数估计算法",481,"2025-11-05 20:51:41",{"path":607,"words":608,"published":609,"date":156},"\u002Fposts\u002F2025\u002F2025-11-09-关于软考高项网规",884,"2025-11-09 19:54:52",{"path":611,"words":612,"published":613,"date":156},"\u002Fposts\u002F2025\u002F2025-11-17-arch-linux运行appimage相关",365,"2025-11-17 09:59:59",{"path":615,"words":616,"published":617,"date":156},"\u002Fposts\u002F2025\u002F2025-11-19-相关概念",2058,"2025-11-19 11:06:20",{"path":619,"words":620,"published":621,"date":156},"\u002Fposts\u002F2025\u002F2025-11-21-web可视化实践canvas",6393,"2025-11-21 14:50:48",{"path":623,"words":624,"published":625,"date":156},"\u002Fposts\u002F2025\u002F2025-11-22-使用-github-actions-自动部署基于vite的项目到-github-pages",272,"2025-11-23 01:59:24",{"path":627,"words":628,"published":629,"date":156},"\u002Fposts\u002F2025\u002F2025-11-22-关于前端包管理器npmpnpmyarn和bun",4890,"2025-11-22 21:21:15",{"path":631,"words":632,"published":633,"date":156},"\u002Fposts\u002F2025\u002F2025-11-23-undo-redo-机制具体实现",7839,"2025-11-23 19:15:00",{"path":635,"words":636,"published":637,"date":156},"\u002Fposts\u002F2025\u002F2025-11-27-前端安全-关于xss与crsf",1866,"2025-11-28 02:05:25",{"path":639,"words":640,"published":641,"date":156},"\u002Fposts\u002F2025\u002F2025-12-05-现代协同-2d-画布编辑器pixijs-v8",4285,"2025-12-05 02:00:16",{"path":643,"words":644,"published":645,"date":156},"\u002Fposts\u002F2025\u002F2025-12-07-杂谈-课题组系统设计",3710,"2025-12-07 21:09:33",{"path":647,"words":648,"published":649,"date":156},"\u002Fposts\u002F2025\u002F2025-12-25-javascript中的数组方法与栈stack和队列queue的实现",474,"2025-11-29 16:58:15",{"path":651,"words":652,"published":653,"date":156},"\u002Fposts\u002F2025\u002F2025-12-25-关于javascript-实现哈希表",189,"2025-11-27 11:31:39",{"path":655,"words":656,"published":657,"date":156},"\u002Fposts\u002F2025\u002F2025-12-25-关于javascript的set方法",332,"2025-12-25 15:26:18",{"path":659,"words":660,"published":661,"date":156},"\u002Fposts\u002F2025\u002F2025-12-25-关于动态规划(背包问题为例)",1238,"2025-11-17 18:24:04",{"path":663,"words":664,"published":665,"date":156},"\u002Fposts\u002F2025\u002F2025-12-25-关于滑动窗口",712,"2025-11-20 15:04:40",{"path":667,"words":668,"published":669,"date":156},"\u002Fposts\u002F2025\u002F2025-12-25-关于链表(javascript)",500,"2025-11-25 13:00:48",{"path":671,"words":672,"published":673,"date":156},"\u002Fposts\u002F2025\u002F2025-12-25-面试算法acm模式构建构建输入输出模板",2051,"2025-12-25 23:09:45",{"path":675,"words":676,"published":677,"date":156},"\u002Fposts\u002F2025\u002F2025-12-26-javascript-数字数组字符串的处理",483,"2025-12-26 11:20:25",{"path":679,"words":680,"published":681,"date":156},"\u002Fposts\u002F2025\u002F2025-12-26-javascripttypescript-的顺序表链表实现",446,"2025-12-26 12:16:12",{"path":683,"words":684,"published":685,"date":156},"\u002Fposts\u002F2025\u002F2025-12-27-前端画布设计vol-1-实现基础yuan素渲染和状态控制",2136,"2025-12-28 01:23:08",{"path":687,"words":688,"published":689,"date":156},"\u002Fposts\u002F2025\u002F2025-12-27-前端画布设计vol-2-实现富文本编辑",1838,"2025-12-28 02:58:47",{"path":691,"words":692,"published":693,"date":156},"\u002Fposts\u002F2025\u002F2025-12-27-算法刷题-关于链表操作",2135,"2025-12-27 16:12:42",{"path":695,"words":696,"published":697,"date":156},"\u002Fposts\u002F2025\u002F2025-12-27-配置dnscrypt-proxy实现加密dns服务windows",1899,"2025-11-15 01:06:37",{"path":699,"words":700,"published":701,"date":156},"\u002Fposts\u002F2025\u002F2025-12-28-前端-关于网络请求xhrajaxfetchaxios",7788,"2025-10-28 15:48:46",{"path":703,"words":704,"published":705,"date":156},"\u002Fposts\u002F2025\u002F2025-12-28-前端-接口封装与请求规范axios为例",2373,"2025-12-29 01:01:18",{"path":707,"words":708,"published":709,"date":156},"\u002Fposts\u002F2025\u002F2025-12-28-前端-身份验证管理-基于-jwt-token-的实现",2709,"2025-11-23 22:04:41",{"path":711,"words":712,"published":713,"date":156},"\u002Fposts\u002F2025\u002F2025-12-29-记canvas画布项目开发",6254,"2025-12-29 04:52:15",{"path":715,"words":716,"published":717,"date":156},"\u002Fposts\u002F2025\u002Fabout-site",116,"2025-03-31 16:44:24",{"path":719,"words":720,"published":721,"date":156},"\u002Fposts\u002F2025\u002F使用neo4j图数据科学库gds进行中心度分析",143,"2025-04-02 23:37:24",{"path":723,"words":724,"published":725,"date":156},"\u002Fposts\u002F2026\u002F2026-01-03-论文实训草稿",10445,"2026-01-03 14:10:49",{"path":727,"words":728,"published":729,"date":156},"\u002Fposts\u002F2026\u002F2026-01-06-人工智能导论",11461,"2026-01-07 03:25:49",{"path":731,"words":732,"published":733,"date":156},"\u002Fposts\u002F2026\u002F2026-01-07-机器学习相关算法",82,"2026-01-08 02:28:13",{"path":735,"words":736,"published":737,"date":156},"\u002Fposts\u002F2026\u002F2026-01-16-关于低复杂度最长链共识算法设计",4466,"2026-01-16 10:33:23",{"path":739,"words":740,"published":741,"date":156},"\u002Fposts\u002F2026\u002F2026-01-19-杂记2026-01-19",5754,"2026-01-20 01:03:26",{"path":743,"words":744,"published":745,"date":156},"\u002Fposts\u002F2026\u002F2026-01-22-github-action-自动同步博客到-github-主页",1069,"2026-01-22 16:31:47",{"path":747,"words":748,"published":749,"date":156},"\u002Fposts\u002F2026\u002F2026-03-01-windows-wsl安装docker",257,"2026-03-01 20:55:31",{"path":751,"words":752,"published":753,"date":156},"\u002Fposts\u002F2026\u002F2026-03-14-关于-msys2",701,"2026-03-15 03:05:04",{"path":755,"words":756,"published":757,"date":156},"\u002Fposts\u002F2026\u002F2026-03-28-团队项目协作规范随记",2419,"2026-03-29 05:33:50",{"path":759,"words":760,"published":761,"date":156},"\u002Fposts\u002F2026\u002F2026-03-29-oh-my-posh配置分享",104,"2026-03-29 16:34:43",{"path":763,"words":764,"published":765,"date":156},"\u002Fposts\u002F2026\u002F2026-06-13-从上下文工程到-agent-harness-engineering",8840,"2026-06-13 21:06:20",{"path":767,"words":768,"published":769,"date":156},"\u002Fposts\u002F2026\u002F2026-07-13-简谈前端基建质量标准与ai友好建设",3814,"2026-07-13 21:06:20",{"path":771,"words":772,"published":773,"date":156},"\u002Fposts\u002F2026\u002F2026-07-15-agentic-rag-系统实践",13357,"2026-07-15 21:06:20",{"path":775,"words":776,"published":777,"date":156},"\u002Fposts\u002F2026\u002F2026-07-18-简谈sdd规范驱动开发-copy",4476,"2026-07-18 11:06:20",{"path":779,"words":780,"published":781,"date":156},"\u002Fposts\u002F2026\u002F2026-07-20-个人neovim配置分享",366,"2026-07-22 13:46:50",{"path":783,"words":784,"published":785,"date":156},"\u002Fposts\u002F2026\u002F2026-07-20-关于技术写作-设计文档",6763,"2026-07-20 13:46:50",{"path":787,"words":788,"published":789,"date":156},"\u002Fposts\u002F2026\u002F2026-07-29-fastapi-工程实践随记",3417,"2026-07-29 04:58:34",{"path":791,"words":792,"published":793,"date":156},"\u002Fposts\u002Frfc_agentic_project\u002F2026-06-19-rfc-liskin_code_agent",3563,"2026-06-19 15:18:20",{"path":795,"words":796,"published":797,"date":156},"\u002Fposts\u002Frfc_agentic_project\u002F2026-07-25-rfc-glushkov_ogas",13461,"2026-07-28 23:46:50",{"path":799,"words":800,"published":793,"date":156},"\u002Fposts\u002Frfc_agentic_project\u002F2026-08-03-adr-ogas-arkhiv",2698,{"path":802,"words":803,"published":804,"date":156},"\u002Fposts\u002Frfc_agentic_project\u002Frag\u002F2026-08-12-arkhiv_rag-vol-1",4366,"2026-08-12 15:18:20",{"path":806,"words":807,"published":808,"date":156},"\u002Fposts\u002Fleetcode\u002F2025-12-25-力扣百题速练javascripttypescriptvol-1",3108,"2025-12-25 13:57:08",{"path":810,"words":811,"published":812,"date":156},"\u002Fposts\u002Fleetcode\u002F2025-12-26-力扣百题速练javascripttypescriptvol-2",3185,"2025-12-26 13:57:08",{"path":814,"words":815,"published":816,"date":156},"\u002Fposts\u002Fleetcode\u002F2025-12-28-力扣百题速练javascripttypescriptvol-3",2533,"2025-12-29 02:15:44",{"path":818,"words":819,"published":820,"date":156},"\u002Fposts\u002Fleetcode\u002F2026-01-17-力扣百题速练javascripttypescriptvol-4",3024,"2026-01-17 22:53:01",{"path":822,"words":823,"published":824,"date":156},"\u002Fposts\u002Fleetcode\u002F2026-01-19-力扣百题速练javascripttypescriptvol-5",293,"2026-01-19 15:15:12",{"path":826,"words":827,"published":828,"date":156},"\u002Fposts\u002F分布式处理与计算\u002F分布式处理与计算spark系统与scala语言",4320,"2026-07-06 14:10:49",{"path":830,"words":831,"published":832,"date":156},"\u002Fposts\u002F分布式处理与计算\u002F分布式处理与计算分类与回归分析",2081,"2026-07-07 12:40:29",{"path":834,"words":835,"published":836,"date":156},"\u002Fposts\u002F分布式处理与计算\u002F分布式处理与计算数值优化方法",2182,"2026-07-07 13:50:29",{"path":838,"words":839,"published":840,"date":156},"\u002Fposts\u002F分布式处理与计算\u002F分布式处理与计算数据降维",1583,"2026-07-07 21:50:29",{"path":842,"words":843,"published":844,"date":156},"\u002Fposts\u002F分布式处理与计算\u002F分布式处理与计算聚类分析",1882,"2026-07-07 16:50:29",{"path":846,"words":847,"published":848,"date":156},"\u002Fposts\u002F分布式处理与计算\u002F分布式处理与计算随机模拟与统计推断",2433,"2026-07-06 22:40:29",{"path":850,"words":851,"published":852,"date":156},"\u002Fposts\u002F数据可视化\u002F2026-06-14-数据可视化-基本图像",10011,"2026-06-14 20:18:20",{"path":854,"words":855,"published":856,"date":156},"\u002Fposts\u002F数据可视化\u002F2026-06-14-数据可视化-概论",10030,"2026-06-14 15:18:20",{"path":858,"words":859,"published":860,"date":156},"\u002Fposts\u002F数据可视化\u002F2026-06-15-数据可视化-可视化库",2032,"2026-06-15 20:18:20",{"path":862,"words":863,"published":864,"date":156},"\u002Fposts\u002F数据结构\u002F2025-09-29-数据结构-图",5451,"2025-04-15 20:48:06",{"path":866,"words":867,"published":868,"date":156},"\u002Fposts\u002F数据结构\u002F2025-09-29-数据结构-树",4211,"2025-04-30 02:19:06",{"path":870,"words":871,"published":872,"date":156},"\u002Fposts\u002F数据结构\u002F2025-09-29-数据结构-队列",921,"2025-04-11 15:30:08",{"path":874,"words":875,"published":876,"date":156},"\u002Fposts\u002F数据结构\u002F关于数据结构的一些想法",456,"2025-04-04 19:13:49",{"path":878,"words":879,"published":880,"date":156},"\u002Fposts\u002F数据结构\u002F数据结构-栈",920,"2025-04-18 00:17:37",{"path":882,"words":883,"published":884,"date":156},"\u002Fposts\u002F数据结构\u002F数据结构-算法复杂度",2153,"2025-04-05 16:09:55",{"path":886,"words":887,"published":888,"date":156},"\u002Fposts\u002F数据结构\u002F数据结构-线性表链表",4572,"2025-04-06 00:24:40",{"path":890,"words":891,"published":892,"date":156},"\u002Fposts\u002F数据结构\u002F数据结构-线性表顺序表",4191,"2025-04-05 22:09:59",{"path":894,"words":895,"published":896,"date":156},"\u002Fposts\u002F数据结构\u002F数据结构-绪论",2881,"2025-04-05 11:31:22",{"path":898,"words":899,"published":156,"date":900},"\u002Fposts\u002F杂记\u002F2023-12-26-2023年12月26日",7,"2023-12-26 23:51:33",{"path":902,"words":899,"published":156,"date":903},"\u002Fposts\u002F杂记\u002F2024-01-01-2024团建","2024-01-01 01:51:27",{"path":905,"words":581,"published":156,"date":906},"\u002Fposts\u002F杂记\u002F2024-01-09-随记","2024-01-09 20:50:35",{"path":908,"words":909,"published":156,"date":910},"\u002Fposts\u002F杂记\u002F2024-03-12-花名",5275,"2024-03-12 16:04:23",{"path":912,"words":913,"published":156,"date":914},"\u002Fposts\u002F杂记\u002F2024-04-15-逆模因",1353,"2024-04-15 00:26:16",{"path":916,"words":917,"published":156,"date":918},"\u002Fposts\u002F杂记\u002F2024-05-03-艺作",27,"2024-05-03 00:01:00",{"path":920,"words":921,"published":156,"date":922},"\u002Fposts\u002F杂记\u002F2024-05-21-关于博客",1720,"2024-02-21 23:21:11",{"path":924,"words":925,"published":156,"date":926},"\u002Fposts\u002F杂记\u002F2024-06-20-dnvrc维克多崔专访-2023",2036,"2024-06-20 00:28:39",{"path":928,"words":760,"published":156,"date":929},"\u002Fposts\u002F杂记\u002F2024-06-25-6月25日随记","2024-06-25 12:46:36",{"path":931,"words":932,"published":156,"date":933},"\u002Fposts\u002F杂记\u002F2024-06-25-歌名-想見星星",148,"2024-06-25 22:47:59",{"path":935,"words":936,"published":156,"date":937},"\u002Fposts\u002F杂记\u002F2024-07-11-桂花岗",6,"2024-07-11 00:28:17",{"path":939,"words":940,"published":156,"date":941},"\u002Fposts\u002F杂记\u002F2024-07-15-rolling-bocci",9,"2024-07-15 21:25:56",{"path":943,"words":944,"published":156,"date":945},"\u002Fposts\u002F杂记\u002F2024-07-22-七月九日",34,"2024-07-09 17:54:23",{"path":947,"words":948,"published":156,"date":949},"\u002Fposts\u002F杂记\u002F2024-07-22-六月随记",1052,"2024-07-22 01:03:19",{"path":951,"words":952,"published":156,"date":953},"\u002Fposts\u002F杂记\u002F2024-07-22-石菖蒲",41,"2024-07-10 01:26:05",{"path":955,"words":514,"published":156,"date":956},"\u002Fposts\u002F杂记\u002F2024-07-23-新书","2024-07-23 01:05:49",{"path":958,"words":959,"published":156,"date":960},"\u002Fposts\u002F杂记\u002F2024-07-29-年前",74,"2024-07-29 23:59:07",{"path":962,"words":963,"published":156,"date":964},"\u002Fposts\u002F杂记\u002F2024-07-30-周边",138,"2024-07-30 02:03:23",{"path":966,"words":967,"published":156,"date":968},"\u002Fposts\u002F杂记\u002F2024-07-31-2024-7-31日",185,"2024-07-31 01:21:52",{"path":970,"words":971,"published":156,"date":972},"\u002Fposts\u002F杂记\u002F2024-08-02-八月",1710,"2024-08-30 00:31:02",{"path":974,"words":975,"published":156,"date":976},"\u002Fposts\u002F杂记\u002F2024-09-01-九月",1484,"2024-09-26 16:30:15",{"path":978,"words":979,"published":156,"date":980},"\u002Fposts\u002F杂记\u002F2024-09-08-2024年9月8日",97,"2024-09-08 13:59:36",{"path":982,"words":514,"published":156,"date":983},"\u002Fposts\u002F杂记\u002F2024-09-19-博客站的一周年","2024-09-18 23:36:24",{"path":985,"words":986,"published":156,"date":987},"\u002Fposts\u002F杂记\u002F2024-10-03-十月",1028,"2024-10-31 23:54:27",{"path":989,"words":990,"published":156,"date":991},"\u002Fposts\u002F杂记\u002F2024-11-04-十一月",2134,"2024-11-30 00:04:39",{"path":993,"words":994,"published":156,"date":995},"\u002Fposts\u002F杂记\u002F2024-11-10-gzhu-site-193",80,"2024-11-10 19:19:12",{"path":997,"words":998,"published":156,"date":999},"\u002Fposts\u002F杂记\u002F2024-12-01-十二月",455,"2024-12-30 23:13:47",{"path":1001,"words":1002,"published":156,"date":1003},"\u002Fposts\u002F杂记\u002F2024-12-21-年末",23,"2024-12-21 23:21:49",{"path":1005,"words":522,"published":156,"date":1006},"\u002Fposts\u002F杂记\u002F2025-01-30-一月","2025-01-30 23:44:41",{"path":1008,"words":1009,"published":156,"date":1010},"\u002Fposts\u002F杂记\u002F2025-03-01-二月",224,"2025-02-28 00:11:08",{"path":1012,"words":1013,"published":156,"date":1014},"\u002Fposts\u002F杂记\u002F2025-03-01-博客杂谈",344,"2025-03-01 16:03:18",{"path":1016,"words":1017,"published":156,"date":1018},"\u002Fposts\u002F杂记\u002F2025-03-05-三月",2090,"2025-03-05 19:17:28",{"path":1020,"words":1021,"published":156,"date":1022},"\u002Fposts\u002F杂记\u002F2025-07-10-七月",361,"2025-07-10 22:04:32",{"path":1024,"words":1025,"published":156,"date":1026},"\u002Fposts\u002F杂记\u002F2025-09-21-九月",781,"2025-09-21 20:53:37",{"path":1028,"words":1029,"published":156,"date":1030},"\u002Fposts\u002F杂记\u002F2025-10-09-十月",591,"2025-10-09 00:35:07",{"path":1032,"words":1033,"published":156,"date":1034},"\u002Fposts\u002F杂记\u002Fcontrol",13,"2023-09-25 13:03:59",{"path":1036,"words":1037,"published":156,"date":1038},"\u002Fposts\u002F杂记\u002Fquadim四叉树图像处理",1094,"2023-10-21 11:27:06",{"path":1040,"words":1041,"published":156,"date":1042},"\u002Fposts\u002F杂记\u002Fsuccess",24,"2023-09-22 15:59:07",{"path":1044,"words":1045,"published":156,"date":1046},"\u002Fposts\u002F杂记\u002F三光年",295,"2023-11-18 04:18:40",{"path":1048,"words":1049,"published":156,"date":1050},"\u002Fposts\u002F杂记\u002F加密测试",961,"2023-11-21 14:24:01",{"path":1052,"words":1053,"published":156,"date":1054},"\u002Fposts\u002F杂记\u002F啊啊啊啊啊啊啊",54,"2023-09-20 17:29:33",{"path":1056,"words":1057,"published":156,"date":1058},"\u002Fposts\u002F杂记\u002F杂谈",124,"2023-09-25 23:11:32",{"path":1060,"words":1061,"published":156,"date":1062},"\u002Fposts\u002F杂记\u002F艹",25,"2023-10-21 17:40:43",{"path":1064,"words":1065,"published":1066,"date":156},"\u002Fposts\u002F神经网络\u002F神经网络与深度学习卷积神经网络",3168,"2026-06-07 11:23:08",{"path":1068,"words":1069,"published":1070,"date":156},"\u002Fposts\u002F神经网络\u002F神经网络与深度学习循环神经网络",2348,"2026-06-07 11:33:08",{"path":1072,"words":1073,"published":1074,"date":156},"\u002Fposts\u002F神经网络\u002F神经网络与深度学习改进学习方法",3360,"2026-06-07 10:13:08",{"path":1076,"words":1077,"published":1078,"date":156},"\u002Fposts\u002F神经网络\u002F神经网络与深度学习深度生成模型",2727,"2026-06-07 11:43:08",{"path":1080,"words":1081,"published":1082,"date":156},"\u002Fposts\u002F神经网络\u002F神经网络与深度学习神经网络基础",3205,"2026-06-07 10:03:08",{"id":1084,"title":1085,"abbrlink":1086,"body":1087,"category":40,"cover":156,"date":156,"description":1097,"extension":1880,"mathjax":1881,"meta":1882,"navigation":1885,"path":882,"published":884,"readingMinutes":899,"seo":1886,"stem":1887,"sticky":156,"swiper_index":156,"tags":1888,"updated":156,"words":883,"__hash__":1889},"posts\u002Fposts\u002F数据结构\u002F数据结构-算法复杂度.md","数据结构-算法复杂度","25842",{"type":1088,"value":1089,"toc":1862},"minimark",[1090,1094,1098,1110,1126,1129,1143,1146,1149,1154,1157,1253,1260,1266,1269,1272,1327,1333,1339,1345,1354,1359,1362,1364,1370,1380,1386,1389,1394,1400,1410,1416,1421,1423,1425,1431,1436,1444,1450,1453,1458,1464,1474,1480,1485,1487,1489,1495,1505,1511,1516,1522,1535,1541,1546,1549,1552,1555,1560,1565,1568,1642,1645,1650,1655,1660,1662,1664,1667,1677,1681,1687,1693,1697,1703,1709,1714,1718,1721,1769,1777,1782,1786,1789,1826,1829,1834,1840,1843,1857],[1091,1092,1093],"h1",{"id":1093},"算法复杂度",[1095,1096,1097],"p",{},"算法复杂度旨在计算在输入数据量 N的情况下，算法的「时间使用」和「空间使用」情况；体现算法运行使用的时间和空间随「数据大小 N」而增大的速度。",[1095,1099,1100,1101,1105,1106,1109],{},"算法复杂度主要可从 ",[1102,1103,1104],"strong",{},"时间"," 、",[1102,1107,1108],{},"空间"," 两个角度评价：",[1111,1112,1113,1120],"ul",{},[1114,1115,1116,1119],"li",{},[1102,1117,1118],{},"时间："," 假设各操作的运行时间为固定常数，统计算法运行的「计算操作的数量」 ，以代表算法运行所需时间；",[1114,1121,1122,1125],{},[1102,1123,1124],{},"空间："," 统计在最差情况下，算法运行所需使用的「最大空间」；",[1095,1127,1128],{},"「输入数据大小N」指算法处理的输入数据量；根据不同算法，具有不同定义，例如：",[1111,1130,1131,1137],{},[1114,1132,1133,1136],{},[1102,1134,1135],{},"排序算法："," N代表需要排序的元素数量；",[1114,1138,1139,1142],{},[1102,1140,1141],{},"搜索算法："," N代表搜索范围的元素总数，例如数组大小、矩阵大小、二叉树节点数、图节点和边数等；",[1095,1144,1145],{},"接下来，我们将分别从概念定义、符号表示、常见种类、时空权衡、示例解析、示例题目等角度入手，学习「时间复杂度」和「空间复杂度」。",[1091,1147,1148],{"id":1148},"时间复杂度",[1095,1150,1151],{},[1102,1152,1153],{},"代码执行次数的简化估算值就是时间复杂度。",[1095,1155,1156],{},"一些例子",[1158,1159,1160,1172,1181,1192,1200,1209],"ol",{},[1114,1161,1162,1163,1167,1168,1171],{},"线性复杂度",[1164,1165,1166],"em",{},"O","(",[1164,1169,1170],{},"N",")：单层循环，如遍历数组求和。",[1114,1173,1174,1175,1177,1178,1180],{},"对数复杂度",[1164,1176,1166],{},"(log",[1164,1179,1170],{},")：二分查找。",[1114,1182,1183,1184,1167,1186,1188,1189,1191],{},"线性对数复杂度",[1164,1185,1166],{},[1164,1187,1170],{},"log",[1164,1190,1170],{},")：快速排序或归并排序的分治策略。",[1114,1193,1194,1195,1167,1197,1199],{},"平方复杂度",[1164,1196,1166],{},[1164,1198,1170],{},"^2)：双重循环，如冒泡排序。",[1114,1201,1202,1203,1205,1206,1208],{},"指数复杂度",[1164,1204,1166],{},"(2^",[1164,1207,1170],{},")：递归斐波那契。",[1114,1210,1211,1212,1167,1214,1216,1217,1220,1221,1223,1224,1177,1226,1228,1229,1167,1231,1228,1233,1167,1235,1188,1237,1228,1239,1167,1241,1243,1244,1205,1246,1228,1248,1167,1250,1252],{},"阶乘复杂度",[1164,1213,1166],{},[1164,1215,1170],{},"!)：全排列生成。",[1218,1219],"br",{},"其中有：",[1164,1222,1166],{},"(1)\u003C",[1164,1225,1166],{},[1164,1227,1170],{},")\u003C",[1164,1230,1166],{},[1164,1232,1170],{},[1164,1234,1166],{},[1164,1236,1170],{},[1164,1238,1170],{},[1164,1240,1166],{},[1164,1242,1170],{},"^2)\u003C",[1164,1245,1166],{},[1164,1247,1170],{},[1164,1249,1166],{},[1164,1251,1170],{},"!)",[1095,1254,1255],{},[1256,1257],"img",{"alt":1258,"src":1259},"","https:\u002F\u002Ffree-img.400040.xyz\u002F4\u002F2025\u002F04\u002F06\u002F67f219793a6bc.png",[1261,1262,1264],"h3",{"id":1263},"基本复杂度计算",[1102,1265,1263],{},[1095,1267,1268],{},"层层（循环、递归）相加：比如有2层循环，第一层循环共执行n次基本语句，每个基本语句执行1次，也就是n个“1”次相加，为n；第二层循环执行log2n次第一次循环，每个第一次循环执行n次，总的也就是log2n个“n”次相加为nlog2n，故时间复杂度为O(nlogn)。",[1261,1270,1271],{"id":1271},"复杂度计算的核心规则",[1158,1273,1274,1285,1298,1315],{},[1114,1275,1276,1279,1280,1284],{},[1102,1277,1278],{},"单层循环","：直接取循环次数，如 ",[1281,1282,1283],"code",{},"O(n)",".",[1114,1286,1287,1290,1291,1294,1295,1284],{},[1102,1288,1289],{},"嵌套循环","：各层循环次数相乘，如 ",[1281,1292,1293],{},"O(n²)"," 或 ",[1281,1296,1297],{},"O(n log n)",[1114,1299,1300,1303,1304,1306,1307,1284,1310,1312,1313,1284],{},[1102,1301,1302],{},"递归算法","：",[1218,1305],{},"\n• 递归次数 × 每次递归的操作次数，如斐波那契数列的 ",[1281,1308,1309],{},"O(2ⁿ)",[1218,1311],{},"\n• 分治策略（如归并排序）通过主定理计算，结果为 ",[1281,1314,1297],{},[1114,1316,1317,1320,1321,1324,1325,1284],{},[1102,1318,1319],{},"忽略低阶项","：如 ",[1281,1322,1323],{},"T(n) = 3n² + 2n + 1"," 简化为 ",[1281,1326,1293],{},[1261,1328,1330],{"id":1329},"_1-o1-常数复杂度",[1102,1331,1332],{},"1. O(1) — 常数复杂度",[1095,1334,1335,1338],{},[1102,1336,1337],{},"特点","：运行次数与 N 大小呈常数关系，即不随输入数据大小 N 的变化而变化。",[1095,1340,1341,1344],{},[1102,1342,1343],{},"示例","：访问数组元素或交换变量。",[1346,1347,1352],"pre",{"className":1348,"code":1350,"language":1351,"meta":1258},[1349],"language-c","\u002F\u002F 访问数组元素\nint getElement(int arr[], int index) {\n    return arr[index]; \u002F\u002F 无论数组大小，直接访问固定位置\n}\n\n\u002F\u002F 交换变量\nvoid swap(int *a, int *b) {\n    int temp = *a;\n    *a = *b;\n    *b = temp; \u002F\u002F 仅需三次赋值操作\n}\n","c",[1281,1353,1350],{"__ignoreMap":1258},[1095,1355,1356],{},[1256,1357],{"alt":1258,"src":1358},"https:\u002F\u002Ffree-img.400040.xyz\u002F4\u002F2025\u002F04\u002F06\u002F67f219792807e.png",[1360,1361],"hr",{},[1360,1363],{},[1261,1365,1367],{"id":1366},"_2-olog-n-对数复杂度",[1102,1368,1369],{},"2. O(log n) — 对数复杂度",[1095,1371,1372,1374,1375,1377,1379],{},[1102,1373,1337],{},"：每次操作将问题规模缩减为固定比例（如折半）。",[1218,1376],{},[1102,1378,1343],{},"：二分查找。",[1346,1381,1384],{"className":1382,"code":1383,"language":1351,"meta":1258},[1349],"int binarySearch(int arr[], int left, int right, int target) {\n    while (left \u003C= right) {\n        int mid = left + (right - left) \u002F 2;\n        if (arr[mid] == target) return mid;\n        if (arr[mid] \u003C target) left = mid + 1;\n        else right = mid - 1; \u002F\u002F 每次搜索范围减半\n    }\n    return -1;\n}\n",[1281,1385,1383],{"__ignoreMap":1258},[1095,1387,1388],{},"如下图所示，为二分查找的时间复杂度示意图，每次二分将搜索区间缩小一半。",[1095,1390,1391],{},[1256,1392],{"alt":1258,"src":1393},"https:\u002F\u002Ffree-img.400040.xyz\u002F4\u002F2025\u002F04\u002F06\u002F67f2197929e82.png",[1261,1395,1397],{"id":1396},"_3-on-线性复杂度",[1102,1398,1399],{},"3. O(n) — 线性复杂度",[1095,1401,1402,1404,1405,1407,1409],{},[1102,1403,1337],{},"：执行时间与输入规模成线性正比。",[1218,1406],{},[1102,1408,1343],{},"：遍历数组求和。",[1346,1411,1414],{"className":1412,"code":1413,"language":1351,"meta":1258},[1349],"int sumArray(int arr[], int size) {\n    int sum = 0;\n    for (int i = 0; i \u003C size; i++) {\n        sum += arr[i]; \u002F\u002F 遍历所有元素，执行次数为n\n    }\n    return sum;\n}\n",[1281,1415,1413],{"__ignoreMap":1258},[1095,1417,1418],{},[1256,1419],{"alt":1258,"src":1420},"https:\u002F\u002Ffree-img.400040.xyz\u002F4\u002F2025\u002F04\u002F06\u002F67f2197926290.png",[1360,1422],{},[1360,1424],{},[1261,1426,1428],{"id":1427},"_4-on-log-n-对数线性复杂度",[1102,1429,1430],{},"4. O(n log n) — 对数线性复杂度",[1095,1432,1433,1435],{},[1102,1434,1337],{},"：两层循环相互独立，第一层和第二层时间复杂度分别为 O(log⁡N) 和 O(N)，则总体时间复杂度为 O(Nlog⁡N)",[1095,1437,1438,1439,1441,1443],{},"结合线性与对数操作，常见于分治算法。",[1218,1440],{},[1102,1442,1343],{},"：快速排序。",[1346,1445,1448],{"className":1446,"code":1447,"language":1351,"meta":1258},[1349],"void quickSort(int arr[], int low, int high) {\n    if (low \u003C high) {\n        int pivot = partition(arr, low, high); \u002F\u002F 分区操作O(n)\n        quickSort(arr, low, pivot - 1);  \u002F\u002F 递归左半部分\n        quickSort(arr, pivot + 1, high); \u002F\u002F 递归右半部分\n    }\n}\n\u002F\u002F 每次递归将问题规模分半，递归深度为log n，每层总操作次数为n\n",[1281,1449,1447],{"__ignoreMap":1258},[1095,1451,1452],{},"线性对数阶常出现于排序算法，例如「快速排序」、「归并排序」、「堆排序」等，其时间复杂度原理如下图所示。",[1095,1454,1455],{},[1256,1456],{"alt":1258,"src":1457},"https:\u002F\u002Ffree-img.400040.xyz\u002F4\u002F2025\u002F04\u002F06\u002F67f219792ceba.png",[1261,1459,1461],{"id":1460},"_5-onᵏ-多项式复杂度k2为例",[1102,1462,1463],{},"5. O(nᵏ) — 多项式复杂度（k=2为例）",[1095,1465,1466,1468,1469,1471,1473],{},[1102,1467,1337],{},"：嵌套循环导致时间复杂度为输入规模的k次方。",[1218,1470],{},[1102,1472,1343],{},"：冒泡排序。 第一层和第二层时间复杂度分别为 O(N) 和 O(N)，则总体时间复杂度为 O(N^2)",[1346,1475,1478],{"className":1476,"code":1477,"language":1351,"meta":1258},[1349],"void bubbleSort(int arr[], int size) {\n    for (int i = 0; i \u003C size-1; i++) {\n        for (int j = 0; j \u003C size-i-1; j++) {\n            if (arr[j] > arr[j+1]) {\n                swap(&arr[j], &arr[j+1]); \u002F\u002F 双重循环，操作次数为n²\n            }\n        }\n    }\n}\n",[1281,1479,1477],{"__ignoreMap":1258},[1095,1481,1482],{},[1256,1483],{"alt":1258,"src":1484},"https:\u002F\u002Ffree-img.400040.xyz\u002F4\u002F2025\u002F04\u002F06\u002F67f2197949027.png",[1360,1486],{},[1360,1488],{},[1261,1490,1492],{"id":1491},"_6-okⁿ-指数复杂度",[1102,1493,1494],{},"6. O(kⁿ) — 指数复杂度",[1095,1496,1497,1499,1500,1502,1504],{},[1102,1498,1337],{},"：问题规模每增加1，计算量翻倍。",[1218,1501],{},[1102,1503,1343],{},"：斐波那契数列的递归实现。",[1346,1506,1509],{"className":1507,"code":1508,"language":1351,"meta":1258},[1349],"int fibonacci(int n) {\n    if (n \u003C= 1) return n;\n    return fibonacci(n-1) + fibonacci(n-2); \u002F\u002F 每次递归分裂为两次调用，复杂度为O(2ⁿ)\n}\n",[1281,1510,1508],{"__ignoreMap":1258},[1095,1512,1513],{},[1256,1514],{"alt":1258,"src":1515},"https:\u002F\u002Ffree-img.400040.xyz\u002F4\u002F2025\u002F04\u002F06\u002F67f21979ba451.png",[1261,1517,1519],{"id":1518},"_7-on-阶乘复杂度",[1102,1520,1521],{},"7. O(n!) — 阶乘复杂度",[1095,1523,1524,1526,1527,1529,1531,1532,1534],{},[1102,1525,1337],{},"：问题规模每增加1，计算量增长为阶乘级。",[1218,1528],{},[1102,1530,1343],{},"：生成全排列，给定 N",[1164,1533,1170],{}," 个互不重复的元素，求其所有可能的排列方案（递归回溯）。",[1346,1536,1539],{"className":1537,"code":1538,"language":1351,"meta":1258},[1349],"int algorithm(int N) {\n    if (N \u003C= 0) return 1;\n    int count = 0;\n    for (int i = 0; i \u003C N; i++) {\n        count += algorithm(N - 1);\n    }\n    return count;\n}\n",[1281,1540,1538],{"__ignoreMap":1258},[1095,1542,1543],{},[1256,1544],{"alt":1258,"src":1545},"https:\u002F\u002Ffree-img.400040.xyz\u002F4\u002F2025\u002F04\u002F06\u002F67f21979bc3d1.png",[1091,1547,1548],{"id":1548},"时间复杂度的意义",[1095,1550,1551],{},"时间复杂度不同，随着输入数据量的增加，代码运行的时间也会增加。",[1095,1553,1554],{},"例如O(1)无论输入数据如何增多，代码运行时间都不变。而O(n)的运行时间和输入数据量成正比。如果时间复杂度过高，例如O(2^n)，那么在小数据情况下，代码还可以运行，一旦数据量增大，则代码的运行时间将会几何级增加。",[1095,1556,1557],{},[1256,1558],{"alt":1258,"src":1559},"https:\u002F\u002Ffree-img.400040.xyz\u002F4\u002F2025\u002F04\u002F06\u002F67f2197c5a42b.png",[1095,1561,1562],{},[1256,1563],{"alt":1258,"src":1564},"https:\u002F\u002Ffree-img.400040.xyz\u002F4\u002F2025\u002F04\u002F06\u002F67f2197b9fefb.png",[1095,1566,1567],{},"代码执行时间总结如下：",[1569,1570,1571,1583],"table",{},[1572,1573,1574],"thead",{},[1575,1576,1577,1581],"tr",{},[1578,1579,1580],"th",{},"名称",[1578,1582,1148],{},[1584,1585,1586,1595,1603,1610,1618,1626,1634],"tbody",{},[1575,1587,1588,1592],{},[1589,1590,1591],"td",{},"常数时间",[1589,1593,1594],{},"O(1)",[1575,1596,1597,1600],{},[1589,1598,1599],{},"对数时间",[1589,1601,1602],{},"O(log n)",[1575,1604,1605,1608],{},[1589,1606,1607],{},"线性时间",[1589,1609,1283],{},[1575,1611,1612,1615],{},[1589,1613,1614],{},"线性对数时间",[1589,1616,1617],{},"O(nlog n)",[1575,1619,1620,1623],{},[1589,1621,1622],{},"二次时间",[1589,1624,1625],{},"O(n^2)",[1575,1627,1628,1631],{},[1589,1629,1630],{},"三次时间",[1589,1632,1633],{},"O(n^3)",[1575,1635,1636,1639],{},[1589,1637,1638],{},"指数时间",[1589,1640,1641],{},"O(2^n)",[1091,1643,1644],{"id":1644},"常见的时间复杂度",[1095,1646,1647],{},[1256,1648],{"alt":1256,"src":1649},"https:\u002F\u002Fpica.zhimg.com\u002F80\u002Fv2-582c21adb0ae8039ad5cf5010c3b46b2_1440w.webp",[1095,1651,1652],{},[1256,1653],{"alt":1256,"src":1654},"https:\u002F\u002Fpic4.zhimg.com\u002F80\u002Fv2-4671f059ba17906a6438c07a6a2815f7_1440w.webp",[1095,1656,1657],{},[1256,1658],{"alt":1256,"src":1659},"https:\u002F\u002Fpic2.zhimg.com\u002F80\u002Fv2-6dd67dfea6b61a260c60b8b6cfc826f3_1440w.webp",[1360,1661],{},[1360,1663],{},[1091,1665,1666],{"id":1666},"空间复杂度",[1668,1669,1670],"blockquote",{},[1095,1671,1672,1673,1676],{},"空间复杂度是对一个算法在运行过程中临时占用存储空间大小的量度。空间复杂度不是程序占用了多少字节的空间，因为这个也没太大意义，所以",[1102,1674,1675],{},"空间复杂度算的是变量的个数","。空间复杂度计算规则基本跟时间复杂度类似，也使用大O渐进表示法。",[1261,1678,1680],{"id":1679},"常数-o1","常数 O(1)",[1346,1682,1685],{"className":1683,"code":1684,"language":1351,"meta":1258},[1349],"\u002F\u002F计算冒泡排序函数的空间复杂度\nvoid BubbleSort(int* a, int N)\n{\n    assert(a);\n    for (int i = 0; i \u003C N; i++)\n    {\n        int exchange = 0;\n        for (int j = 0; j \u003C N - 1 - i; j++)\n        {\n            if (a[j]>a[j + 1])\n            {\n                int tmp = a[j];\n                a[j] = a[j + 1];\n                a[j + 1] = tmp;\n                exchange = 1;\n            }\n        }\n        if (exchange == 0)\n            break;\n    }\n}\n",[1281,1686,1684],{"__ignoreMap":1258},[1095,1688,1689,1690,1692],{},"冒泡排序函数中使用了常数个额外空间（即常数个变量），所以用大O的渐进表示法表示冒泡排序函数的空间复杂度为",[1102,1691,1594],{}," 。",[1261,1694,1696],{"id":1695},"线性-on","线性 O*(*N)",[1346,1698,1701],{"className":1699,"code":1700,"language":1351,"meta":1258},[1349],"\u002F\u002F计算阶乘递归函数的空间复杂度\nlong long Factorial(size_t N)\n{\n    return N \u003C 2 ? N : Factorial(N - 1)*N;\n}\n",[1281,1702,1700],{"__ignoreMap":1258},[1095,1704,1705,1706,1692],{},"阶乘递归函数会依次调用Factorial(N),Factorial(N-1),…,Factorial(2),Factorial(1)，开辟了N个空间，所以空间复杂度为",[1102,1707,1708],{},"O(N)",[1095,1710,1711],{},[1256,1712],{"alt":1258,"src":1713},"https:\u002F\u002Ffree-img.400040.xyz\u002F4\u002F2025\u002F04\u002F06\u002F67f2197a7f3a0.png",[1261,1715,1717],{"id":1716},"平方-on","平方 O(N²)",[1095,1719,1720],{},"元素数量与 N呈平方关系的任意类型集合（常见于矩阵），皆使用平方大小的空间。",[1158,1722,1723,1729,1739],{},[1114,1724,1725,1728],{},[1102,1726,1727],{},"递归调用栈的深度","\n每次递归调用参数递减 1，直到 N ≤ 0。递归深度为 N 次（例如 N=5 时调用链为 algorithm(5) → algorithm(4) → ... → algorithm(0)）",[1114,1730,1731,1734,1735,1738],{},[1102,1732,1733],{},"每次递归的临时空间占用","\n每次递归调用时，会在栈上动态创建一个大小为 N 的整型数组 ",[1281,1736,1737],{},"int nums[N]","。随着递归深度增加，数组长度的变化为 N, N-1, N-2, ..., 1",[1114,1740,1741,1744,1745,1167,1748,1750,1751,1753,1754,1756,1757,1759,1760,1167,1762,1764,1765,1768],{},[1102,1742,1743],{},"空间累计计算","\n总空间占用为各次递归调用中数组大小的累加：\n",[1164,1746,1747],{},"S",[1164,1749,1170],{},")=",[1164,1752,1170],{},"+(",[1164,1755,1170],{},"−1)+(",[1164,1758,1170],{},"−2)+⋯+1=2",[1164,1761,1170],{},[1164,1763,1170],{},"+1)​\n根据大 O 表示法，简化为 ​",[1102,1766,1767],{},"​O(N²)​","​",[1346,1770,1775],{"className":1771,"code":1773,"language":1774,"meta":1258},[1772],"language-c++","int algorithm(int N) {\n    if (N \u003C= 0) return 0;\n    int nums[N];\n    return algorithm(N - 1);\n}\n","c++",[1281,1776,1773],{"__ignoreMap":1258},[1095,1778,1779],{},[1256,1780],{"alt":1258,"src":1781},"https:\u002F\u002Ffree-img.400040.xyz\u002F4\u002F2025\u002F04\u002F06\u002F67f2197a7bf34.png",[1261,1783,1785],{"id":1784},"指数-o2ᴺ","指数 O(2ᴺ)",[1095,1787,1788],{},"指数阶常见于二叉树、多叉树的空间分析，例如：",[1158,1790,1791,1808],{},[1114,1792,1793,1794,1796,1797,1799,1800,1803,1804,1807],{},"满二叉树",[1218,1795],{},"高度为 ",[1102,1798,1170],{}," 的满二叉树，节点总数为 ",[1102,1801,1802],{},"2ᴺ","，空间复杂度为 ",[1102,1805,1806],{},"O(2ᴺ)","。",[1114,1809,1810,1811,1796,1813,1815,1816,1807,1819,1821,1822,1825],{},"满 m 叉树",[1218,1812],{},[1102,1814,1170],{}," 的满 m 叉树，节点总数为 ",[1102,1817,1818],{},"mᴺ",[1218,1820],{},"当 m 为常数时，",[1102,1823,1824],{},"O(mᴺ) = O(2ᴺ)","（指数级增长性质相同）。",[1095,1827,1828],{},"指数阶常见于二叉树、多叉树。例如，高度为 N的「满二叉树」的节点数量为 2^N，占用 O(2^N)大小的空间；同理，高度为 N的「满 m叉树」的节点数量为 m^N，占用 O(m^N)大小的空间。",[1095,1830,1831],{},[1256,1832],{"alt":1258,"src":1833},"https:\u002F\u002Ffree-img.400040.xyz\u002F4\u002F2025\u002F04\u002F06\u002F67f2197a8e599.png",[1261,1835,1837],{"id":1836},"对数-olog-n",[1102,1838,1839],{},"对数 O(log N)",[1095,1841,1842],{},"对数阶常出现于分治算法的栈帧空间累计、数据类型转换等，例如：",[1111,1844,1845,1851],{},[1114,1846,1847,1850],{},[1102,1848,1849],{},"快速排序","，平均空间复杂度为 Θ(log N)，最差空间复杂度为 O(N)。\n通过应用尾递归优化，可以将快速排序的最差空间复杂度限定至 O(N)。",[1114,1852,1853,1856],{},[1102,1854,1855],{},"数字转化为字符串","，设某正整数为 N，则字符串的空间复杂度为 O(log N)。\n正整数 N 的位数为 log₁₀ N，即转化的字符串长度为 log₁₀ N，因此空间复杂度为 O(log N)。",[1095,1858,1859],{},[1102,1860,1861],{},"注：递归算法的空间复杂度通常是递归的深度（即递归多少层）。",{"title":1258,"searchDepth":1863,"depth":1863,"links":1864},4,[1865,1867,1868,1869,1870,1871,1872,1873,1874,1875,1876,1877,1878,1879],{"id":1263,"depth":1866,"text":1263},3,{"id":1271,"depth":1866,"text":1271},{"id":1329,"depth":1866,"text":1332},{"id":1366,"depth":1866,"text":1369},{"id":1396,"depth":1866,"text":1399},{"id":1427,"depth":1866,"text":1430},{"id":1460,"depth":1866,"text":1463},{"id":1491,"depth":1866,"text":1494},{"id":1518,"depth":1866,"text":1521},{"id":1679,"depth":1866,"text":1680},{"id":1695,"depth":1866,"text":1696},{"id":1716,"depth":1866,"text":1717},{"id":1784,"depth":1866,"text":1785},{"id":1836,"depth":1866,"text":1839},"md",false,{"uuid":1883,"slots":1884},"5c1e1360-11f5-11f0-9809-89ee360a3930",{},true,{"title":1085,"description":1097},"posts\u002F数据结构\u002F数据结构-算法复杂度",[42,40,373],"KElY9JmZjkGlwnK9MG2TwSOO-acHHm-lh6agqXpP1GE",1790443288640]