CINXE.COM
遍历 - 标签 - 腾讯云开发者社区-腾讯云
<!DOCTYPE html><html munual-autotracker-init="" qct-pv-id="JeX64BswnRdBMhmh2VMB5" qct-ip="8.222.208.146"><head><meta charSet="UTF-8"/><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"/><title>遍历 - 标签 - 腾讯云开发者社区-腾讯云</title><meta name="keywords" content="遍历,云+社区标签"/><meta name="subjectTime" content="2023-03-14 11:34:53"/><meta name="description" content=""/><meta name="viewport" content="width=device-width, initial-scale=1.0, maximum-scale=1, viewport-fit=cover"/><meta name="format-detection" content="telephone=no"/><link rel="canonical" href="https://cloud.tencent.com/developer/tag/17187"/><link rel="stylesheet" href="//cloudcache.tencent-cloud.cn/open_proj/proj_qcloud_v2/gateway/portal/css/global-20209142343.css"/><link rel="stylesheet" href="//cloudcache.tencent-cloud.cn/qcloud/ui/cloud-community/build/base/base-202410111735.css"/><link rel="stylesheet" href="//cloudcache.tencent-cloud.cn/open_proj/proj_qcloud_v2/community-pc/build/AskDialog/AskDialog-202204021635.css?max_age=31536000"/><link rel="stylesheet" href="//cloudcache.tencent-cloud.cn/open_proj/proj_qcloud_v2/community-pc/build/AskDialog/AskDialog-202204021635.css?max_age=31536000"/><link rel="stylesheet" href="//cloudcache.tencent-cloud.cn/qcloud/ui/community-pc/build/base/base-202412201223.css"/><link rel="stylesheet" href="//cloudcache.tencent-cloud.cn/qcloud/ui/cloud-community/build/base/base-202410111735.css"/><link rel="stylesheet" href="//cloudcache.tencent-cloud.cn/open_proj/proj_qcloud_v2/community-pc/build/Tag/Tag-202105140928.css?max_age=31536000"/><link rel="stylesheet" href="//cloudcache.tencent-cloud.cn/open_proj/proj_qcloud_v2/community/portal/css/markdown-201810241044.css?max_age=31536000"/><link rel="stylesheet" href="//cloudcache.tencent-cloud.cn/qcloud/draft-master/dist/draft-master-v2.0.142.d4s2ddo9sb.css?max_age=31536000"/><style media="screen">@supports (padding:max(0px)){.set-safe-area .com-main{bottom:calc(max(12px,constant(safe-area-inset-bottom)) + 50px);bottom:calc(max(12px,env(safe-area-inset-bottom)) + 50px)}.set-safe-area .com-main-simple-sec,.set-safe-area .com-main.without-tab-ft,.set-safe-area .com-main.without-ft{bottom:max(12px,constant(safe-area-inset-bottom));bottom:max(12px,env(safe-area-inset-bottom))}.set-safe-area .com-main-sec{bottom:max(12px,constant(safe-area-inset-bottom));bottom:max(12px,env(safe-area-inset-bottom))}.set-safe-area .com-m-footer,.set-safe-area .sa-fixed-btns{bottom:max(12px,constant(safe-area-inset-bottom));bottom:max(12px,env(safe-area-inset-bottom))}.set-safe-area .com-mobile-body{bottom:max(12px,constant(safe-area-inset-bottom));bottom:max(12px,env(safe-area-inset-bottom))}}@supports (padding:max(0px)){.set-safe-area .support-wrap,.set-safe-area div.body{bottom:max(12px,constant(safe-area-inset-bottom));bottom:max(12px,env(safe-area-inset-bottom))}.set-safe-area .com-responsive-no-ft div.body{bottom:max(12px,constant(safe-area-inset-bottom));bottom:max(12px,env(safe-area-inset-bottom))}}.doc-con .J-docShareModal{display: none;} .doc-con .J-docShareCopyTipModalMB{display: none} .with-focus+.com-main-simple-sec, .with-focus+.com-main,.with-focus+.com-body,.with-focus+.qa-body{top:100px} .qa-detail-ask-panel:after{display:none!important;} .sa-fixed-btns .c-btn-weak{background-color: #fff;} .qa-r-editor.draft-editor-host.rno-markdown{height: 290px;overflow-y:auto;} .uc-achievement{line-height:24px;margin-bottom:5px;white-space: initial;overflow:visible;text-overflow:initial} .uc-achievement .uc-achievement-icon{top:0;margin-top:0;}</style></head><body style="position:initial"><div id="react-root" class=""><div class="comp-tag-detail"><div class="cdc-header is-fixed"><div class="cdc-header__placeholder"></div><div class="cdc-header__inner"><div class="cdc-header__top"><div class="cdc-header__top-left"><a href="/?from=20060&from_column=20060" target="_blank" class="cdc-header__top-logo"><i>腾讯云</i></a><div class="cdc-header__top-line"></div><a href="/developer" class="cdc-header__top-logo community"><i>开发者社区</i></a><div class="cdc-header__activity"><div id="cloud-header-product-container"></div></div></div><div class="cdc-header__top-operates"><a href="/document/product?from=20702&from_column=20702" target="_blank" class="cdc-header__link">文档</a><a href="/voc/?from=20703&from_column=20703" target="_blank" class="cdc-header__link">建议反馈</a><a href="https://console.cloud.tencent.com?from=20063&from_column=20063" target="_blank" class="cdc-header__link" track-click="{"areaId":102001,"subAreaId":1}">控制台</a><div class="cdc-header__account"><div class="cdc-header__account-inner"><button class="cdc-btn cdc-header__account-btn cdc-btn--primary">登录/注册</button></div></div></div></div><div class="cdc-header__bottom"><div class="cdc-header__bottom-nav"><a href="/developer" class="cdc-header__bottom-home">首页</a><div class="cdc-header__nav-list"><div class="cdc-header__nav-item">学习</div><div class="cdc-header__nav-item">活动</div><div class="cdc-header__nav-item">专区</div><div class="cdc-header__nav-item">工具</div></div><a href="/tvp?from=20154&from_column=20154" class="cdc-header__tvp" target="_blank">TVP</a><div class="cdc-header__activity"><a class="cdc-header__activity-tit" href="/act?from=20061&from_column=20061" target="_blank">最新优惠活动<div class="cdc-badge"><div class="cdc-badge-inner"><div class="cdc-badge-text"></div></div></div></a></div><div id="community-header-product-container"></div></div><div class="cdc-header__bottom-operates"><div class="cdc-header__search"><div class="cdc-search__wrap"><div class="cdc-search"><span class="cdc-search__text">文章/答案/技术大牛</span><button class="cdc-search__btn">搜索<i class="cdc-search__i search"></i></button></div><div class="cdc-search__dropdown"><div class="cdc-search__bar"><input type="text" class="cdc-search__bar-input" placeholder="文章/答案/技术大牛" value=""/><div class="cdc-search__bar-btns"><button class="cdc-search__btn">搜索<i class="cdc-search__i search"></i></button><button class="cdc-search__btn">关闭<i class="cdc-search__i clear"></i></button></div></div></div></div></div><div class="cdc-header__create"><span class="cdc-header__create-btn not-logged"><span class="cdc-svg-icon-con"><span class="cdc-svg-icon" style="line-height:1;color:#0052D9;width:16px;height:16px"><svg width="16" height="16" viewBox="0 0 16 16" fill="currentcolor" xmlns="http://www.w3.org/2000/svg"><path d="M14.2466 12.0145C14.1698 13.6258 12.8381 14.9131 11.2129 14.9131H11.1579H4.0927H4.03772C2.4125 14.9131 1.08014 13.6258 1.00334 12.0145H1V11.8668V4.07213V4.04627V3.89922H1.00334C1.08014 2.28732 2.4125 1 4.03772 1H9.6473V1.00069H10.0786L8.7688 2.10773H8.43888H7.7916H6.37904H4.03772C2.97234 2.10773 2.10445 2.9777 2.10445 4.04629V4.41869V4.4472V6.39498V11.4269V11.4309V11.8668C2.10445 12.9354 2.97234 13.8053 4.03772 13.8053H6.37904H8.87153H11.2129C12.2782 13.8053 13.1461 12.9355 13.1461 11.8668V11.466V11.454V9.5181V6.39364L14.2506 5.3051V11.8668V12.0145H14.2466ZM10.4324 7.15226L9.63146 7.99761C9.36577 8.2693 8.69326 8.95104 8.48066 9.17631C8.26726 9.40288 8.09039 9.58901 7.95061 9.73544C7.81079 9.88188 7.72667 9.96597 7.70083 9.98656C7.63321 10.0488 7.55703 10.1144 7.47022 10.1846C7.38412 10.2542 7.29404 10.3099 7.20063 10.3516C7.10722 10.4007 6.97072 10.459 6.79049 10.5305C6.61028 10.6001 6.42213 10.6676 6.22468 10.7339C6.02792 10.8002 5.84109 10.8571 5.66484 10.9061C5.48795 10.9538 5.3561 10.9863 5.2693 11.0009C5.08977 11.0214 4.96988 10.993 4.90956 10.9168C4.84931 10.8405 4.83276 10.7107 4.85924 10.5312C4.87315 10.4331 4.9043 10.292 4.95468 10.1078C5.00431 9.92297 5.05802 9.7315 5.11431 9.53341C5.1713 9.33526 5.22629 9.15179 5.27926 8.98484C5.33297 8.8179 5.37599 8.7026 5.40978 8.64032C5.44953 8.54357 5.49463 8.45413 5.54495 8.37399C5.59465 8.29379 5.66616 8.20503 5.75965 8.10766C5.79934 8.06588 5.89281 7.96649 6.03988 7.81018C6.18624 7.65311 6.80114 7.02774 7.02104 6.79783L7.75117 6.03524L8.56212 5.1899L10.6345 3.02466L12.5214 4.93874L10.4324 7.15226ZM13.816 3.58581C13.7166 3.68987 13.6272 3.78064 13.5483 3.85883C13.4694 3.93703 13.4006 4.0066 13.3423 4.06686C13.276 4.13643 13.2144 4.19738 13.1561 4.24903L11.2785 2.33569C11.3785 2.24025 11.4965 2.12565 11.6336 1.99115C11.7707 1.85668 11.8854 1.75061 11.9761 1.67242C12.0934 1.57708 12.2133 1.51013 12.3385 1.47109C12.4525 1.43529 12.5644 1.41805 12.6751 1.41876H12.7056C12.7665 1.42139 12.8268 1.42729 12.8851 1.43724C12.8838 1.4366 12.8811 1.43724 12.8798 1.4366C12.8811 1.4366 12.8838 1.4366 12.8851 1.43724C13.1376 1.48428 13.4019 1.62009 13.6265 1.83743C13.7511 1.95871 13.8524 2.09382 13.9259 2.23296C14.0346 2.43834 14.0863 2.65304 14.0763 2.8491C14.0763 2.87294 14.0783 2.89748 14.0783 2.92201C14.0783 3.03529 14.0571 3.14789 14.0154 3.26055C13.9737 3.37314 13.9067 3.48185 13.816 3.58581Z" fill="#0052D9"></path></svg></span></span>发布<span class="cdc-svg-icon-con cdc-header__create-btn-arrow"><span class="cdc-svg-icon" style="line-height:1;color:inherit;width:16px;height:16px"><svg width="16" height="16" viewBox="0 0 16 16" fill="currentcolor" xmlns="http://www.w3.org/2000/svg"><path d="M8.16377 4L9.57798 5.41421L14.5277 10.364L13.1135 11.7782L8.1638 6.829L3.21402 11.7782L1.7998 10.364L8.16377 4Z"></path></svg></span></span></span></div></div></div></div></div><div class="cdc-m-header with-focus is-fixed"><div class="cdc-m-header__placeholder"></div><div class="cdc-m-header__inner"><div class="cdc-m-guider-banner is-sticky"><div class="cdc-m-guider-banner__guide-mvp" track-exposure="{"areaId":118000}" track-click="{"areaId":118000}"><div class="cdc-m-guider-banner__guide-mvp-text">精选内容/技术社群/优惠产品,<em>尽在小程序</em></div><div class="cdc-m-guider-banner__guide-mvp-btn">立即前往</div></div></div><div class="cdc-m-header__main"><div class="cdc-m-header__trigger"></div><div class="cdc-m-header__logo"><i class="cdc-m-header__logo-icon"></i></div><div class="cdc-m-header__search"><i class="cdc-m-header__search-icon"></i></div><div class="cdc-m-header__operate"><span class="cdc-m-header__operate-icon"></span></div></div></div></div><div class="J-body com-body max-width"><div class="com-crumb"><div class="com-inner"><a href="/developer" class="crumb-item">首页</a><span class="crumb-split"></span><a href="/developer/tags" class="crumb-item">标签</a><span class="crumb-split"></span><span class="crumb-item current">遍历</span></div></div><div track-click="{"areaId":{"areaId":113006}}" track-exposure="{"areaId":{"areaId":113006}}" class="com-tag-intro"><i class="intro-bg"></i><h2 class="intro-title"><em>#</em>遍历</h2><p class="intro-desc"></p><div class="intro-btns"><button type="button" class="c-btn" track-click="{"elementId":1}">关注</button></div></div><div class="com-2-layout"><div class="layout-main"><div class="com-tab large tag-tab"><div class="com-tab-hd large"><ul class="com-tab-ctrl"><li class="com-tab-item actived"><a href="javascript:;">专栏文章<span class="num">(3.9K)</span></a></li><li class="com-tab-item"><a href="/developer/tag/17187?entry=video">技术视频<span class="num">(0)</span></a></li><li class="com-tab-item"><a href="/developer/tag/17187?entry=ask">互动问答<span class="num">(67)</span></a></li></ul></div><div class="com-tab-bd"><div class="com-tab-panel" style="min-height:800px"><div class="com-article-panel-v2-list"><section class="com-article-panel-v2 higher"><a href="/developer/article/2496977" track-click="{"areaId":113001,"objectType":"article","objectId":2496977}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2496977}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">【Html.js——功能实现】收集帛书碎片（蓝桥杯真题-5135）【合集】</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/12571?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":12571}" class="com-tag-v2">class</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17290?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17290}" class="com-tag-v2">函数</a><a href="/developer/tag/17457?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17457}" class="com-tag-v2">数组</a><a href="/developer/tag/10205?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10205}" class="com-tag-v2">html</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/yehe-100000/42616b383b9aa7d71d297762166e7469.png?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/11416571" track-click="{"objectType":"user","objectId":11416571}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/ad9204ee324eff126f4b5ebac6707046.jpg?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/11416571" track-click="{"objectType":"user","objectId":11416571}" target="_blank" class="author-info name">Rossy Yan</a><span class="author-info time"><time dateTime="2025-02-17 15:17:53" title="2025-02-17 15:17:53"> <span>5</span>小时前<span class="com-v-box">2025-02-17 15:17:53</span></time></span></div></div></div><p class="com-article-panel-v2-des">请在 collect-puzzle.js 文件中补全函数 collectPuzzle 中的代码，返回包含不同帛书碎片的数组，最终拼出完整的战国帛书，需要注意：</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>1</span><span class="com-opt-link link-like"><i class="com-i-like"></i>0</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2496977.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2496878" track-click="{"areaId":113001,"objectType":"article","objectId":2496878}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2496878}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">【记忆化搜索】最长递增子序列</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/17457?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17457}" class="com-tag-v2">数组</a><a href="/developer/tag/17459?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17459}" class="com-tag-v2">搜索</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17234?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17234}" class="com-tag-v2">递归</a><a href="/developer/tag/17290?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17290}" class="com-tag-v2">函数</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/yehe-100000/a0589d4d9b447dc73c65cc5eb4e84ab9.png?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/10147998" track-click="{"objectType":"user","objectId":10147998}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/10147998" track-click="{"objectType":"user","objectId":10147998}" target="_blank" class="author-info name">利刃大大</a><span class="author-info time"><time dateTime="2025-02-16 20:09:09" title="2025-02-16 20:09:09"> <span>1</span>天前<span class="com-v-box">2025-02-16 20:09:09</span></time></span></div></div></div><p class="com-article-panel-v2-des"> 如果我们要直接递归进去求整个数组的最长递增子序列的长度的话，其实不好搞，但是如果我们在主函数中用一个 for 循环，遍历每个元素，让每个元素都作为起点获取其...</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>19</span><span class="com-opt-link link-like"><i class="com-i-like"></i>1</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2496878.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2496864" track-click="{"areaId":113001,"objectType":"article","objectId":2496864}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2496864}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">floodfill算法系列一＞太平洋大西洋水流问题</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/14059?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":14059}" class="com-tag-v2">int</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17423?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17423}" class="com-tag-v2">设计</a><a href="/developer/tag/17460?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17460}" class="com-tag-v2">算法</a><a href="/developer/tag/13022?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":13022}" class="com-tag-v2">dfs</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/yehe-100000/f704c7fd23c679afa04c1a72ec2af916.png?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/11305962" track-click="{"objectType":"user","objectId":11305962}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/avatar/5962.png?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/11305962" track-click="{"objectType":"user","objectId":11305962}" target="_blank" class="author-info name">用户11305962</a><span class="author-info time"><time dateTime="2025-02-16 19:56:46" title="2025-02-16 19:56:46"> <span>1</span>天前<span class="com-v-box">2025-02-16 19:56:46</span></time></span></div></div></div><p class="com-article-panel-v2-des"></p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>19</span><span class="com-opt-link link-like"><i class="com-i-like"></i>0</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2496864.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2496540" track-click="{"areaId":113001,"objectType":"article","objectId":2496540}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2496540}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">【记忆化搜索】记忆化搜索算法的对比及总结</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17234?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17234}" class="com-tag-v2">递归</a><a href="/developer/tag/17244?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17244}" class="com-tag-v2">动态规划</a><a href="/developer/tag/17457?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17457}" class="com-tag-v2">数组</a><a href="/developer/tag/17459?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17459}" class="com-tag-v2">搜索</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/yehe-100000/04299020c269cd2879173dba5c874492.png?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/10147998" track-click="{"objectType":"user","objectId":10147998}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/10147998" track-click="{"objectType":"user","objectId":10147998}" target="_blank" class="author-info name">利刃大大</a><span class="author-info time"><time dateTime="2025-02-15 10:15:10" title="2025-02-15 10:15:10"> <span>2</span>天前<span class="com-v-box">2025-02-15 10:15:10</span></time></span></div></div></div><p class="com-article-panel-v2-des"> 仔细一想，我们只需要规避已经遍历过的子树，就能减少很多不必要的递归啦，那么要想知道已经遍历过哪些节点，就 可以使用一个 ”备忘录“ 记录下之前遍历过的节点，...</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>70</span><span class="com-opt-link link-like"><i class="com-i-like"></i>1</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2496540.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2495976" track-click="{"areaId":113001,"objectType":"article","objectId":2495976}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2495976}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">【floodfill深搜】太平洋大西洋水流问题 && 扫雷游戏 &&衣橱整理</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/17457?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17457}" class="com-tag-v2">数组</a><a href="/developer/tag/10666?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10666}" class="com-tag-v2">游戏</a><a href="/developer/tag/14059?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":14059}" class="com-tag-v2">int</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17234?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17234}" class="com-tag-v2">递归</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/yehe-100000/e40d15d2330c4e6c3925ec110a43086a.png?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/10147998" track-click="{"objectType":"user","objectId":10147998}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/10147998" track-click="{"objectType":"user","objectId":10147998}" target="_blank" class="author-info name">利刃大大</a><span class="author-info time"><time dateTime="2025-02-13 09:49:40" title="2025-02-13 09:49:40"> <span>4</span>天前<span class="com-v-box">2025-02-13 09:49:40</span></time></span></div></div></div><p class="com-article-panel-v2-des"> 此时重点来了，我们遍历两个布尔值数组，判断两个数组中是否存在位置都为 true 的，存在的话说明从这个位置是可以同时流向两个洋，则添加到结果集中，如果不存在...</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>54</span><span class="com-opt-link link-like"><i class="com-i-like"></i>1</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2495976.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2495866" track-click="{"areaId":113001,"objectType":"article","objectId":2495866}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2495866}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">2025-02-11：合并两棵树后的最小直径。用go语言，给定两棵无向树，第一棵树有 n 个节点，第二棵树有 m 个节点，节点编</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/17358?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17358}" class="com-tag-v2">连接</a><a href="/developer/tag/14626?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":14626}" class="com-tag-v2">max</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17234?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17234}" class="com-tag-v2">递归</a><a href="/developer/tag/17290?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17290}" class="com-tag-v2">函数</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/756f354da9d9036910df53c307d5549a.jpg?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/7620466" track-click="{"objectType":"user","objectId":7620466}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/4b93323c1bab6e531362f6c37b49d6b5.jpg?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/7620466" track-click="{"objectType":"user","objectId":7620466}" target="_blank" class="author-info name">福大大架构师每日一题</a><span class="author-info time"><time dateTime="2025-02-12 15:37:01" title="2025-02-12 15:37:01"> <span>5</span>天前<span class="com-v-box">2025-02-12 15:37:01</span></time></span></div></div></div><p class="com-article-panel-v2-des">2.在 dfs 函数中，通过递归遍历树的节点，计算每个非父节点到根节点的最长路径。在遍历过程中更新直径的长度。</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>33</span><span class="com-opt-link link-like"><i class="com-i-like"></i>0</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2495866.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2495773" track-click="{"areaId":113001,"objectType":"article","objectId":2495773}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2495773}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">《Go小技巧&易错点100例》第二十九篇</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17290?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17290}" class="com-tag-v2">函数</a><a href="/developer/tag/17304?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17304}" class="com-tag-v2">技巧</a><a href="/developer/tag/10174?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10174}" class="com-tag-v2">go</a><a href="/developer/tag/14059?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":14059}" class="com-tag-v2">int</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/79330f407e0d2b4dfa9780adb3196a21.jpg?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/7215614" track-click="{"objectType":"user","objectId":7215614}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/9b57db9aa00d5388ac366ff00be64007.jpg?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/7215614" track-click="{"objectType":"user","objectId":7215614}" target="_blank" class="author-info name">闫同学</a><span class="author-info time"><time dateTime="2025-02-12 13:57:34" title="2025-02-12 13:57:34"> <span>5</span>天前<span class="com-v-box">2025-02-12 13:57:34</span></time></span></div></div></div><p class="com-article-panel-v2-des">在旧版本中，需要手动遍历 slice 来求最大/最小值。而在 Go 1.21+ 中，slices.Max 和 slices.Min 让这件事变得更简单。</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>76</span><span class="com-opt-link link-like"><i class="com-i-like"></i>2</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2495773.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2495727" track-click="{"areaId":113001,"objectType":"article","objectId":2495727}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2495727}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">【C++】二叉搜索树（搜索二叉树）</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/17440?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17440}" class="com-tag-v2">数据</a><a href="/developer/tag/17459?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17459}" class="com-tag-v2">搜索</a><a href="/developer/tag/10166?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10166}" class="com-tag-v2">c++</a><a href="/developer/tag/10734?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10734}" class="com-tag-v2">二叉树</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/yehe-100000/12938c9f2f3057fef38b7eda93a514d2.png?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/11323570" track-click="{"objectType":"user","objectId":11323570}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/avatar/23570.png?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/11323570" track-click="{"objectType":"user","objectId":11323570}" target="_blank" class="author-info name">羚羊角</a><span class="author-info time"><time dateTime="2025-02-12 10:01:02" title="2025-02-12 10:01:02"> <span>5</span>天前<span class="com-v-box">2025-02-12 10:01:02</span></time></span></div></div></div><p class="com-article-panel-v2-des"> 本篇聊聊二叉搜索树，二叉树基本知识的详细讲解在【数据结构】二叉树 。</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>76</span><span class="com-opt-link link-like"><i class="com-i-like"></i>1</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2495727.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2495702" track-click="{"areaId":113001,"objectType":"article","objectId":2495702}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2495702}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">【floodfill深搜】岛屿的最大面积 && 被围绕的区域</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/14059?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":14059}" class="com-tag-v2">int</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17234?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17234}" class="com-tag-v2">递归</a><a href="/developer/tag/17457?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17457}" class="com-tag-v2">数组</a><a href="/developer/tag/13785?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":13785}" class="com-tag-v2">grid</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/yehe-100000/c9855f320967cd515cbdd9add4947bb8.png?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/10147998" track-click="{"objectType":"user","objectId":10147998}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/10147998" track-click="{"objectType":"user","objectId":10147998}" target="_blank" class="author-info name">利刃大大</a><span class="author-info time"><time dateTime="2025-02-12 09:39:01" title="2025-02-12 09:39:01"> <span>5</span>天前<span class="com-v-box">2025-02-12 09:39:01</span></time></span></div></div></div><p class="com-article-panel-v2-des"> 这道题无非就是 200. 岛屿数量 的变形，从求岛屿个数变成求岛屿的最大面积，那么我们只需要做个小小调整，在遍历途中记录下面积，然后遍历完之后更新一下最大面...</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>32</span><span class="com-opt-link link-like"><i class="com-i-like"></i>0</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2495702.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2495398" track-click="{"areaId":113001,"objectType":"article","objectId":2495398}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2495398}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">10分钟-带你走进H5-五子棋</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/17429?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17429}" class="com-tag-v2">事件</a><a href="/developer/tag/17457?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17457}" class="com-tag-v2">数组</a><a href="/developer/tag/17470?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17470}" class="com-tag-v2">统计</a><a href="/developer/tag/10847?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10847}" class="com-tag-v2">canvas</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/yehe-100000/0be46734b59e230083677c254f0949d0.webp?imageView2/2/w/400/h/7000/format/jpg)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/1614009" track-click="{"objectType":"user","objectId":1614009}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/6bb87b4fd171a539099b6253723a025a.jpg?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/1614009" track-click="{"objectType":"user","objectId":1614009}" target="_blank" class="author-info name">万少</a><span class="author-info time"><time dateTime="2025-02-11 14:11:51" title="2025-02-11 14:11:51"> <span>6</span>天前<span class="com-v-box">2025-02-11 14:11:51</span></time></span></div></div></div><p class="com-article-panel-v2-des">需要注意的是，想要修改 canvas标签的宽度和高度，不能直接在css中改，否则是拉伸canvas。只能在标签的属性上通过 width 和 height来改</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>99</span><span class="com-opt-link link-like"><i class="com-i-like"></i>1</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2495398.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2495378" track-click="{"areaId":113001,"objectType":"article","objectId":2495378}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2495378}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">【数据结构】二叉树</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/10734?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10734}" class="com-tag-v2">二叉树</a><a href="/developer/tag/10812?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10812}" class="com-tag-v2">数据结构</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17247?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17247}" class="com-tag-v2">队列</a><a href="/developer/tag/17457?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17457}" class="com-tag-v2">数组</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/yehe-100000/072870798716589935d00ed6ff5ecabf.png?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/11323570" track-click="{"objectType":"user","objectId":11323570}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/avatar/23570.png?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/11323570" track-click="{"objectType":"user","objectId":11323570}" target="_blank" class="author-info name">羚羊角</a><span class="author-info time"><time dateTime="2025-02-11 14:03:39" title="2025-02-11 14:03:39"> <span>6</span>天前<span class="com-v-box">2025-02-11 14:03:39</span></time></span></div></div></div><p class="com-article-panel-v2-des">学习二叉树结构，最简单的方式就是遍历。所谓二叉树遍历(Traversal)是按照某种特定的规则，依次对二叉树中的结点进行相应的操作，并且每个结点只操作一次。</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>62</span><span class="com-opt-link link-like"><i class="com-i-like"></i>1</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2495378.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2495333" track-click="{"areaId":113001,"objectType":"article","objectId":2495333}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2495333}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">【floodfill深搜】岛屿数量 && 岛屿的最大面积</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/10576?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10576}" class="com-tag-v2">渲染</a><a href="/developer/tag/13785?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":13785}" class="com-tag-v2">grid</a><a href="/developer/tag/14059?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":14059}" class="com-tag-v2">int</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17234?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17234}" class="com-tag-v2">递归</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/yehe-100000/baa12027cc3aadc88bff6ebcb30a7ae4.png?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/10147998" track-click="{"objectType":"user","objectId":10147998}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/10147998" track-click="{"objectType":"user","objectId":10147998}" target="_blank" class="author-info name">利刃大大</a><span class="author-info time"><time dateTime="2025-02-11 13:14:32" title="2025-02-11 13:14:32"> <span>6</span>天前<span class="com-v-box">2025-02-11 13:14:32</span></time></span></div></div></div><p class="com-article-panel-v2-des"> 给你一个由 '1'（陆地）和 '0'（水）组成的的二维网格，请你计算网格中岛屿的数量。</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>44</span><span class="com-opt-link link-like"><i class="com-i-like"></i>0</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2495333.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2495303" track-click="{"areaId":113001,"objectType":"article","objectId":2495303}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2495303}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">Java-线索二叉树的实现</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/10734?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10734}" class="com-tag-v2">二叉树</a><a href="/developer/tag/15429?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":15429}" class="com-tag-v2">public</a><a href="/developer/tag/15764?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":15764}" class="com-tag-v2">root</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/10164?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10164}" class="com-tag-v2">java</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/1650713" track-click="{"objectType":"user","objectId":1650713}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/1650713" track-click="{"objectType":"user","objectId":1650713}" target="_blank" class="author-info name">leehao</a><span class="author-info time"><time dateTime="2025-02-11 12:56:27" title="2025-02-11 12:56:27"> <span>6</span>天前<span class="com-v-box">2025-02-11 12:56:27</span></time></span></div></div></div><p class="com-article-panel-v2-des"></p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>43</span><span class="com-opt-link link-like"><i class="com-i-like"></i>1</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2495303.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2495301" track-click="{"areaId":113001,"objectType":"article","objectId":2495301}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2495301}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">Java-二叉树-插入、删除、遍历</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/10164?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10164}" class="com-tag-v2">java</a><a href="/developer/tag/10734?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10734}" class="com-tag-v2">二叉树</a><a href="/developer/tag/15429?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":15429}" class="com-tag-v2">public</a><a href="/developer/tag/15764?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":15764}" class="com-tag-v2">root</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/1650713" track-click="{"objectType":"user","objectId":1650713}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/1650713" track-click="{"objectType":"user","objectId":1650713}" target="_blank" class="author-info name">leehao</a><span class="author-info time"><time dateTime="2025-02-11 12:56:02" title="2025-02-11 12:56:02"> <span>6</span>天前<span class="com-v-box">2025-02-11 12:56:02</span></time></span></div></div></div><p class="com-article-panel-v2-des"></p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>78</span><span class="com-opt-link link-like"><i class="com-i-like"></i>1</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2495301.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2495299" track-click="{"areaId":113001,"objectType":"article","objectId":2495299}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2495299}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">Java--消除重复数字后的最大值</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/17460?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17460}" class="com-tag-v2">算法</a><a href="/developer/tag/10164?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10164}" class="com-tag-v2">java</a><a href="/developer/tag/14493?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":14493}" class="com-tag-v2">list</a><a href="/developer/tag/16227?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":16227}" class="com-tag-v2">stack</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/1650713" track-click="{"objectType":"user","objectId":1650713}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/1650713" track-click="{"objectType":"user","objectId":1650713}" target="_blank" class="author-info name">leehao</a><span class="author-info time"><time dateTime="2025-02-11 12:54:05" title="2025-02-11 12:54:05"> <span>6</span>天前<span class="com-v-box">2025-02-11 12:54:05</span></time></span></div></div></div><p class="com-article-panel-v2-des">42234，消除4 得到4223 或者 2234 ，再消除2，得到423或234，取最大值423</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>27</span><span class="com-opt-link link-like"><i class="com-i-like"></i>0</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2495299.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2495295" track-click="{"areaId":113001,"objectType":"article","objectId":2495295}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2495295}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">Java-约瑟夫问题（Josephus Problem）</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/17188?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17188}" class="com-tag-v2">变量</a><a href="/developer/tag/17457?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17457}" class="com-tag-v2">数组</a><a href="/developer/tag/10164?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10164}" class="com-tag-v2">java</a><a href="/developer/tag/10666?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10666}" class="com-tag-v2">游戏</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/1650713" track-click="{"objectType":"user","objectId":1650713}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/1650713" track-click="{"objectType":"user","objectId":1650713}" target="_blank" class="author-info name">leehao</a><span class="author-info time"><time dateTime="2025-02-11 12:52:18" title="2025-02-11 12:52:18"> <span>6</span>天前<span class="com-v-box">2025-02-11 12:52:18</span></time></span></div></div></div><p class="com-article-panel-v2-des">据说着名犹太历史学家 Josephus有过以下的故事：在罗马人占领乔塔帕特后，39 个犹太人与Josephus及他的朋友躲到一个洞中，39个犹太人决定宁愿死也不...</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>48</span><span class="com-opt-link link-like"><i class="com-i-like"></i>0</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2495295.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2495294" track-click="{"areaId":113001,"objectType":"article","objectId":2495294}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2495294}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">KTV</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/17440?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17440}" class="com-tag-v2">数据</a><a href="/developer/tag/17457?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17457}" class="com-tag-v2">数组</a><a href="/developer/tag/14059?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":14059}" class="com-tag-v2">int</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17205?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17205}" class="com-tag-v2">测试</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/1650713" track-click="{"objectType":"user","objectId":1650713}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/1650713" track-click="{"objectType":"user","objectId":1650713}" target="_blank" class="author-info name">leehao</a><span class="author-info time"><time dateTime="2025-02-11 12:51:57" title="2025-02-11 12:51:57"> <span>6</span>天前<span class="com-v-box">2025-02-11 12:51:57</span></time></span></div></div></div><p class="com-article-panel-v2-des">有n个人去KTV唱歌，每个人都有自己想唱的一些歌曲。已知该KTV的每个房间都只有x个麦克风，同一首歌可以同时多个人一起唱，但是同时唱的人不能超过x个人，同一时刻...</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>47</span><span class="com-opt-link link-like"><i class="com-i-like"></i>0</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2495294.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2494894" track-click="{"areaId":113001,"objectType":"article","objectId":2494894}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2494894}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">2025-02-08：找出有效子序列的最大长度Ⅰ。用go语言，给定一个整数数组 nums，我们需要找出其最长的“有效子序列”的长</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/10665?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10665}" class="com-tag-v2">存储</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17188?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17188}" class="com-tag-v2">变量</a><a href="/developer/tag/17290?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17290}" class="com-tag-v2">函数</a><a href="/developer/tag/17457?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17457}" class="com-tag-v2">数组</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/bd2793373f7adc8bfef687f834ac36ae.jpg?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/7620466" track-click="{"objectType":"user","objectId":7620466}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/4b93323c1bab6e531362f6c37b49d6b5.jpg?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/7620466" track-click="{"objectType":"user","objectId":7620466}" target="_blank" class="author-info name">福大大架构师每日一题</a><span class="author-info time"><time dateTime="2025-02-10 15:24:14" title="2025-02-10 15:24:14"> <span>7</span>天前<span class="com-v-box">2025-02-10 15:24:14</span></time></span></div></div></div><p class="com-article-panel-v2-des">2025-02-08：找出有效子序列的最大长度Ⅰ。用go语言，给定一个整数数组 nums，我们需要找出其最长的“有效子序列”的长度。有效子序列的定义为：一个长度...</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>32</span><span class="com-opt-link link-like"><i class="com-i-like"></i>0</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2494894.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2494893" track-click="{"areaId":113001,"objectType":"article","objectId":2494893}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2494893}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">2025-02-09：找出有效子序列的最大长度Ⅱ。用go语言，给定一个整数数组 nums 和一个正整数 k，我们定义一个子序列</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17457?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17457}" class="com-tag-v2">数组</a><a href="/developer/tag/14059?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":14059}" class="com-tag-v2">int</a><a href="/developer/tag/14626?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":14626}" class="com-tag-v2">max</a><a href="/developer/tag/15731?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":15731}" class="com-tag-v2">return</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/394cff59e929cfa6b1adc33ea39b7c3e.jpg?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/7620466" track-click="{"objectType":"user","objectId":7620466}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/4b93323c1bab6e531362f6c37b49d6b5.jpg?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/7620466" track-click="{"objectType":"user","objectId":7620466}" target="_blank" class="author-info name">福大大架构师每日一题</a><span class="author-info time"><time dateTime="2025-02-10 15:23:52" title="2025-02-10 15:23:52"> <span>7</span>天前<span class="com-v-box">2025-02-10 15:23:52</span></time></span></div></div></div><p class="com-article-panel-v2-des">2025-02-09：找出有效子序列的最大长度Ⅱ。用go语言，给定一个整数数组 nums 和一个正整数 k，我们定义一个子序列 sub 的长度为 x，如果满足以...</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>64</span><span class="com-opt-link link-like"><i class="com-i-like"></i>1</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2494893.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section><section class="com-article-panel-v2 higher"><a href="/developer/article/2494843" track-click="{"areaId":113001,"objectType":"article","objectId":2494843}" track-exposure="{"areaId":113001,"objectType":"article","objectId":2494843}" target="_blank" class="com-article-panel-v2-link"></a><div class="com-article-panel-v2-hd"><h3 class="com-article-panel-v2-title">【floodfill深搜】图像渲染，这题不来试试？</h3><nav class="com-tag-v2-list com-article-panel-v2-tags"><a href="/developer/tag/13990?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":13990}" class="com-tag-v2">image</a><a href="/developer/tag/17187?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17187}" class="com-tag-v2">遍历</a><a href="/developer/tag/17234?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17234}" class="com-tag-v2">递归</a><a href="/developer/tag/17460?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":17460}" class="com-tag-v2">算法</a><a href="/developer/tag/10576?entry=article" track-click="{"areaId":113001,"objectType":"tag","objectId":10576}" class="com-tag-v2">渲染</a></nav></div><div class="com-article-panel-v2-bd"><div class="com-article-panel-v2-object"><span class="com-article-panel-v2-img" style="background-image:url(https://developer.qcloudimg.com/http-save/yehe-100000/c834b857bd45ac261ee7e049cace91be.png?imageView2/2/w/400/h/7000)"></span></div><div class="com-article-panel-v2-cnt"><div class="com-article-panel-v2-user-wrap"><div class="com-media com-user-infos"><a href="/developer/user/10147998" track-click="{"objectType":"user","objectId":10147998}" target="_blank" class="com-media-object"><span class="com-media-img" style="background-image:url(https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg?imageView2/2/w/48/h/7000)"></span></a><div class="com-media-body"><a href="/developer/user/10147998" track-click="{"objectType":"user","objectId":10147998}" target="_blank" class="author-info name">利刃大大</a><span class="author-info time"><time dateTime="2025-02-10 14:19:05" title="2025-02-10 14:19:05"> <span>7</span>天前<span class="com-v-box">2025-02-10 14:19:05</span></time></span></div></div></div><p class="com-article-panel-v2-des"> 而对于 floodfill 算法，用 深度优先遍历和广度优先遍历 都是可以处理的，我们这里就以深度优先遍历为例展开叙述！</p><div class="com-operations com-article-panel-v2-opt"><span class="com-opt-link link-view"><i class="com-i-view"></i>39</span><span class="com-opt-link link-like"><i class="com-i-like"></i>0</span><span class="com-opt-link link-comment"><i class="com-i-dialog"></i>0</span><span><a href="javascript:;" class="com-opt-link link-share" hotrep="community.tag.tag_detail.activities.article.2494843.sharing"><i class="com-i-share"></i></a><ul class="com-share-options"></ul></span></div></div></div></section></div><div><div class="c-loading c-loading-tip"><div class="c-loading-inner"><div class="one"></div><div class="two"></div><div class="three"></div></div></div></div></div></div></div></div><div class="layout-side" track-click="" track-exposure=""><div class="com-2-section side"><header class="com-2-section-hd"><h2 class="com-2-section-title without-icon"><span><em>热门</em>专栏</span></h2></header><div class="com-2-section-bd"><div class="com-side-column-panels-wrap"><div class="com-side-column-panels-cnt"><ul track-click="{"areaId":113004}" track-exposure="{"areaId":113004}" class="com-side-column-panels"><li class="panel-cell"><a href="/developer/column/1165" trackClick="{"objectType":"column","objectId":1165}" class="com-media com-side-column-panel"><div class="com-media-object"><span class="com-2-avatar"><span class="com-2-avatar-inner" style="background-image:url(https://ask.qcloudimg.com/avatar/female/rkclsi9ZHum.png)"></span></span></div><div class="com-media-body"><h3 class="com-side-column-panel-title">饶文津的专栏</h3><div class="com-side-column-panel-infos"><div class="com-datas"><span class="com-data">478 文章</span><span class="com-data">35 订阅</span></div></div></div></a></li><li class="panel-cell"><a href="/developer/column/1283" trackClick="{"objectType":"column","objectId":1283}" class="com-media com-side-column-panel"><div class="com-media-object"><span class="com-2-avatar"><span class="com-2-avatar-inner" style="background-image:url(https://ask.qcloudimg.com/http-save/yehe-170434/568f3e8410f6654284c65b8e886345e3.png?imageView2/2/w/76/h/7000)"></span></span></div><div class="com-media-body"><h3 class="com-side-column-panel-title">腾讯技术工程官方号的专栏</h3><div class="com-side-column-panel-infos"><div class="com-datas"><span class="com-data">1.1K 文章</span><span class="com-data">921 订阅</span></div></div></div></a></li><li class="panel-cell"><a href="/developer/column/1362" trackClick="{"objectType":"column","objectId":1362}" class="com-media com-side-column-panel"><div class="com-media-object"><span class="com-2-avatar"><span class="com-2-avatar-inner" style="background-image:url(https://ask.qcloudimg.com/http-save/yehe-598196/3af616d0f6d7dd025d79e3d85a644644.png?imageView2/2/w/76/h/7000)"></span></span></div><div class="com-media-body"><h3 class="com-side-column-panel-title">微信终端开发团队的专栏</h3><div class="com-side-column-panel-infos"><div class="com-datas"><span class="com-data">111 文章</span><span class="com-data">517 订阅</span></div></div></div></a></li><li class="panel-cell"><a href="/developer/column/1551" trackClick="{"objectType":"column","objectId":1551}" class="com-media com-side-column-panel"><div class="com-media-object"><span class="com-2-avatar"><span class="com-2-avatar-inner" style="background-image:url(https://ask.qcloudimg.com/developer-images/custom-avatar/1002332/ep9vu2jcbd.jpg)"></span></span></div><div class="com-media-body"><h3 class="com-side-column-panel-title">腾讯云数据库(TencentDB)</h3><div class="com-side-column-panel-infos"><div class="com-datas"><span class="com-data">863 文章</span><span class="com-data">405 订阅</span></div></div></div></a></li></ul></div></div></div></div></div></div></div><div class="cdc-footer J-footer com-2-footer"><div class="cdc-footer__inner"><div class="cdc-footer__main"><div class="cdc-footer__website"><ul class="cdc-footer__website-group"><li class="cdc-footer__website-column"><div class="cdc-footer__website-box"><h3 class="cdc-footer__website-title">社区</h3><ul class="cdc-footer__website-list"><li class="cdc-footer__website-item"><a href="/developer/column">专栏文章</a></li><li class="cdc-footer__website-item"><a href="/developer/inventory">阅读清单</a></li><li class="cdc-footer__website-item"><a href="/developer/ask">互动问答</a></li><li class="cdc-footer__website-item"><a href="/developer/salon">技术沙龙</a></li><li class="cdc-footer__website-item"><a href="/developer/video">技术视频</a></li><li class="cdc-footer__website-item"><a href="/developer/teams">团队主页</a></li><li class="cdc-footer__website-item"><a href="/developer/timl">腾讯云TI平台</a></li></ul></div></li><li class="cdc-footer__website-column"><div class="cdc-footer__website-box"><h3 class="cdc-footer__website-title">活动</h3><ul class="cdc-footer__website-list"><li class="cdc-footer__website-item"><a href="/developer/support-plan">自媒体同步曝光计划</a></li><li class="cdc-footer__website-item"><a href="/developer/support-plan-invitation">邀请作者入驻</a></li><li class="cdc-footer__website-item"><a href="/developer/article/1535830">自荐上首页</a></li><li class="cdc-footer__website-item"><a href="/developer/competition">技术竞赛</a></li></ul></div></li><li class="cdc-footer__website-column"><div class="cdc-footer__website-box"><h3 class="cdc-footer__website-title">资源</h3><ul class="cdc-footer__website-list"><li class="cdc-footer__website-item"><a href="/developer/specials">技术周刊</a></li><li class="cdc-footer__website-item"><a href="/developer/tags">社区标签</a></li><li class="cdc-footer__website-item"><a href="/developer/devdocs">开发者手册</a></li><li class="cdc-footer__website-item"><a href="/lab?from=20064&from_column=20064">开发者实验室</a></li></ul></div></li><li class="cdc-footer__website-column"><div class="cdc-footer__website-box"><h3 class="cdc-footer__website-title">关于</h3><ul class="cdc-footer__website-list"><li class="cdc-footer__website-item"><a rel="nofollow" href="/developer/article/1006434">社区规范</a></li><li class="cdc-footer__website-item"><a rel="nofollow" href="/developer/article/1006435">免责声明</a></li><li class="cdc-footer__website-item"><a rel="nofollow" href="mailto:cloudcommunity@tencent.com">联系我们</a></li><li class="cdc-footer__website-item"><a rel="nofollow" href="/developer/friendlink">友情链接</a></li></ul></div></li></ul></div><div class="cdc-footer__qr"><h3 class="cdc-footer__qr-title">腾讯云开发者</h3><div class="cdc-footer__qr-object"><img class="cdc-footer__qr-image" src="https://qcloudimg.tencent-cloud.cn/raw/a8907230cd5be483497c7e90b061b861.png" alt="扫码关注腾讯云开发者"/></div><div class="cdc-footer__qr-infos"><p class="cdc-footer__qr-info"><span class="cdc-footer__qr-text">扫码关注腾讯云开发者</span></p><p class="cdc-footer__qr-info"><span class="cdc-footer__qr-text">领取腾讯云代金券</span></p></div></div></div><div class="cdc-footer__recommend"><div class="cdc-footer__recommend-rows"><div class="cdc-footer__recommend-cell"><h3 class="cdc-footer__recommend-title">热门产品</h3><div class="cdc-footer__recommend-wrap"><ul class="cdc-footer__recommend-list"><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="https://dnspod.cloud.tencent.com?from=20064&from_column=20064">域名注册</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/cvm?from=20064&from_column=20064">云服务器</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/tbaas?from=20064&from_column=20064">区块链服务</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/mq?from=20064&from_column=20064">消息队列</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/dsa?from=20064&from_column=20064">网络加速</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/tencentdb-catalog?from=20064&from_column=20064">云数据库</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/cns?from=20064&from_column=20064">域名解析</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/cos?from=20064&from_column=20064">云存储</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/css?from=20064&from_column=20064">视频直播</a></li></ul></div></div><div class="cdc-footer__recommend-cell"><h3 class="cdc-footer__recommend-title">热门推荐</h3><div class="cdc-footer__recommend-wrap"><ul class="cdc-footer__recommend-list"><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/facerecognition?from=20064&from_column=20064">人脸识别</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/tm?from=20064&from_column=20064">腾讯会议</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/act/pro/enterprise2019?from=20064&from_column=20064">企业云</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/cdn-scd?from=20064&from_column=20064">CDN加速</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/trtc?from=20064&from_column=20064">视频通话</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/tiia?from=20064&from_column=20064">图像分析</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/cdb?from=20064&from_column=20064">MySQL 数据库</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/symantecssl?from=20064&from_column=20064">SSL 证书</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/asr?from=20064&from_column=20064">语音识别</a></li></ul></div></div><div class="cdc-footer__recommend-cell"><h3 class="cdc-footer__recommend-title">更多推荐</h3><div class="cdc-footer__recommend-wrap"><ul class="cdc-footer__recommend-list"><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/solution/data_protection?from=20064&from_column=20064">数据安全</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/clb?from=20064&from_column=20064">负载均衡</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/sms?from=20064&from_column=20064">短信</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/ocr?from=20064&from_column=20064">文字识别</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/vod?from=20064&from_column=20064">云点播</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="https://tm.cloud.tencent.com?from=20064&from_column=20064">商标注册</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/solution/la?from=20064&from_column=20064">小程序开发</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/cat?from=20064&from_column=20064">网站监控</a></li><li class="cdc-footer__recommend-item"><a class="com-2-footer-recommend-link" href="/product/cdm?from=20064&from_column=20064">数据迁移</a></li></ul></div></div></div></div><div class="cdc-footer__copyright"><div class="cdc-footer__copyright-text"><p>Copyright © 2013 - <!-- -->2025<!-- --> Tencent Cloud. All Rights Reserved. 腾讯云 版权所有<!-- --> </p><p>深圳市腾讯计算机系统有限公司 ICP备案/许可证号：<a href="https://beian.miit.gov.cn/#/Integrated/index" target="_blank">粤B2-20090059<!-- --> </a><a href="https://www.beian.gov.cn/portal/index.do" target="_blank">深公网安备号 44030502008569</a></p><p>腾讯云计算（北京）有限责任公司 京ICP证150476号 | <!-- --> <a href="https://beian.miit.gov.cn/#/Integrated/index" target="_blank">京ICP备11018762号</a> | <!-- --> <a href="https://www.beian.gov.cn/portal/index.do" target="_blank">京公网安备号11010802020287</a></p></div></div></div></div></div><div class="com-widget-global"><div style="position:relative;z-index:8088"><div class="com-widget-global2"><div class="com-widget-global2__btn code"><div class="com-widget-global2__btn-tag">领券</div></div><div class="com-widget-global2__btn top" style="visibility:hidden"></div></div></div></div><div id="dialog-root"></div><div id="rno-dialog-root" class="rno-modal-wrap"></div></div><script>window.isServerContext = false; window.isClientContext = true;</script><script>window.$serverTime = 1739798107875; window.$clientTime = 1739798107875;</script><script class="">window.$ua = {"browser":{"name":"IE","version":"7.0","major":"7"},"cpu":{},"device":{},"engine":{},"os":{"name":"Windows","version":"Vista"}};</script><script src="//cloudcache.tencent-cloud.com/qcloud/developer/scripts/release/libs/dom4/1.8.3/dom4.js"></script><script src="https://cloudcache.tencent-cloud.com/qcloud/main/scripts/release/common/vendors/babel/polyfill.6.26.min.js"></script><script src="https://cloudcache.tencent-cloud.com/qcloud/main/scripts/release/common/vendors/react/react.16.8.6.min.js"></script><script src="https://cloudcache.tencent-cloud.com/qcloud/main/scripts/release/common/vendors/react/react-dom.16.8.6.min.js"></script><script src="https://cloudcache.tencent-cloud.com/qcloud/main/scripts/release/common/vendors/jquery-3.2.1.min.js"></script><script src="//cloudcache.tencent-cloud.com/qcloud/developer/scripts/release/base.225e98f95c.js?max_age=31536000" crossorigin="anonymous"></script><script src="//cloudcache.tencent-cloud.com/qcloud/draft-master/dist/draft-master-v2.0.142.d4s2ddo9sb.js?max_age=31536000"></script><script src="https://cloud.tencent.com/qccomponent/login/api.js"></script><script src="//cloudcache.tencent-cloud.com/qcloud/main/scripts/release/common/deps/wechatJsSdk.js?version=1_0_1&max_age=31536000"></script><script src="//cloudcache.tencent-cloud.com/qcloud/developer/scripts/release/common.39501a9c5d.js?max_age=31536000" crossorigin="anonymous"></script><script src="https://web.sdk.qcloud.com/player/tcplayer/release/v4.7.2/tcplayer.v4.7.2.min.js"></script><script src="//dscache.tencent-cloud.cn/ecache/qcstat/qcloud/qcloudStatApi.js"></script><script src="https://qccommunity.qcloudimg.com/common/exposure-plugin-4.1.15.min.js"></script><script src="https://qccommunity.qcloudimg.com/community-track/qcloud-community-track.min.js"></script><script src="https://dscache.tencent-cloud.com/sdk/dianshi-sdk/loader/umd/dianshi-sdk-loader.v0.0.18.js"></script><script src="//cloudcache.tencent-cloud.com/qcloud/developer/scripts/release/tag/tag-detail.16dc4ab4f9.js?max_age=31536000" crossorigin="anonymous"></script><script class=""> window.$render({"tagInfo":{"id":17187,"name":"遍历","icon":"","defaultIcon":"//cloudcache.tencent-cloud.com/open_proj/proj_qcloud_v2/gateway/q-and-a/css/img/tags/tag_comm.svg","shareIcon":"https://cloudcache.tencent-cloud.com/open_proj/proj_qcloud_v2/gateway/q-and-a/css/img/tags/share_comm.png","initial":"B","desc":"","followCount":0,"questionCount":67,"answerCount":71,"unanswerCount":4,"articleCount":3933,"devdocCount":0,"vlogCount":0,"boundProductId":0,"stick":{"articleIds":[],"askIds":[],"vlogIds":[]},"createTime":"2023-03-14 11:34:53"},"activeRelatedEntry":"article","timelineData":{"ask":{"fetchStatus":"none","done":false,"nextPageNumber":1,"pageSize":20,"total":0,"list":[]},"article":{"fetchStatus":"loaded","done":false,"nextPageNumber":2,"pageSize":20,"total":3916,"list":[{"id":2496977,"articleId":2496977,"title":"【Html.js——功能实现】收集帛书碎片（蓝桥杯真题-5135）【合集】","content":"","plain":"","brief":"","summary":"请在 collect-puzzle.js 文件中补全函数 collectPuzzle 中的代码，返回包含不同帛书碎片的数组，最终拼出完整的战国帛书，需要注意：","abstract":"请在 collect-puzzle.js 文件中补全函数 collectPuzzle 中的代码，返回包含不同帛书碎片的数组，最终拼出完整的战国帛书，需要注意：","posterSummary":"","description":"","picture":"https://developer.qcloudimg.com/http-save/yehe-100000/42616b383b9aa7d71d297762166e7469.png","coverImageUrl":"https://developer.qcloudimg.com/http-save/yehe-100000/42616b383b9aa7d71d297762166e7469.png","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":11416571,"columnId":104497,"columnIds":[],"writeTime":1739776673,"updateTime":1739776673,"viewCount":1,"likeCount":0,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/http-save/10011/ad9204ee324eff126f4b5ebac6707046.jpg","company":"","introduce":"YOLO","isProfessionVerified":0,"nickname":"Rossy Yan","title":"","uid":11416571,"id":11416571,"name":"Rossy Yan","avatar":"https://developer.qcloudimg.com/http-save/10011/ad9204ee324eff126f4b5ebac6707046.jpg"},"tags":[{"tagId":12571,"tagName":"class","id":12571,"name":"class"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17290,"tagName":"函数","id":17290,"name":"函数"},{"tagId":17457,"tagName":"数组","id":17457,"name":"数组"},{"tagId":10205,"tagName":"html","id":10205,"name":"html"}]},{"id":2496878,"articleId":2496878,"title":"【记忆化搜索】最长递增子序列","content":"","plain":"","brief":"","summary":" 如果我们要直接递归进去求整个数组的最长递增子序列的长度的话，其实不好搞，但是如果我们在主函数中用一个 for 循环，遍历每个元素，让每个元素都作为起点获取其...","abstract":" 如果我们要直接递归进去求整个数组的最长递增子序列的长度的话，其实不好搞，但是如果我们在主函数中用一个 for 循环，遍历每个元素，让每个元素都作为起点获取其...","posterSummary":" 如果我们要直接递归进去求整个数组的最长递增子序列的长度的话，其实不好搞，但是如果我们在主函数中用一个 for 循环，遍历每个元素，让每个元素都作为起点获取其最长递增子序列的长度，然后再记录下最长的那个就行了，这样子相对来说好办一些！","description":"","picture":"https://developer.qcloudimg.com/http-save/yehe-100000/a0589d4d9b447dc73c65cc5eb4e84ab9.png","coverImageUrl":"https://developer.qcloudimg.com/http-save/yehe-100000/a0589d4d9b447dc73c65cc5eb4e84ab9.png","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":10147998,"columnId":99139,"columnIds":[],"writeTime":1739707749,"updateTime":1739707749,"viewCount":19,"likeCount":1,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg","company":"","introduce":"心灵激情不在，就可能被打败！","isProfessionVerified":0,"nickname":"利刃大大","title":"","uid":10147998,"id":10147998,"name":"利刃大大","avatar":"https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg"},"tags":[{"tagId":17457,"tagName":"数组","id":17457,"name":"数组"},{"tagId":17459,"tagName":"搜索","id":17459,"name":"搜索"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17234,"tagName":"递归","id":17234,"name":"递归"},{"tagId":17290,"tagName":"函数","id":17290,"name":"函数"}]},{"id":2496864,"articleId":2496864,"title":"floodfill算法系列一＞太平洋大西洋水流问题","content":"","plain":"","brief":"","summary":"","abstract":"","posterSummary":"","description":"","picture":"https://developer.qcloudimg.com/http-save/yehe-100000/f704c7fd23c679afa04c1a72ec2af916.png","coverImageUrl":"https://developer.qcloudimg.com/http-save/yehe-100000/f704c7fd23c679afa04c1a72ec2af916.png","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":11305962,"columnId":103901,"columnIds":[],"writeTime":1739707006,"updateTime":1739707006,"viewCount":19,"likeCount":0,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/avatar/5962.png","company":"","introduce":"","isProfessionVerified":0,"nickname":"用户11305962","title":"","uid":11305962,"id":11305962,"name":"用户11305962","avatar":"https://developer.qcloudimg.com/avatar/5962.png"},"tags":[{"tagId":14059,"tagName":"int","id":14059,"name":"int"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17423,"tagName":"设计","id":17423,"name":"设计"},{"tagId":17460,"tagName":"算法","id":17460,"name":"算法"},{"tagId":13022,"tagName":"dfs","id":13022,"name":"dfs"}]},{"id":2496540,"articleId":2496540,"title":"【记忆化搜索】记忆化搜索算法的对比及总结","content":"","plain":"","brief":"","summary":" 仔细一想，我们只需要规避已经遍历过的子树，就能减少很多不必要的递归啦，那么要想知道已经遍历过哪些节点，就 可以使用一个 ”备忘录“ 记录下之前遍历过的节点，...","abstract":" 仔细一想，我们只需要规避已经遍历过的子树，就能减少很多不必要的递归啦，那么要想知道已经遍历过哪些节点，就 可以使用一个 ”备忘录“ 记录下之前遍历过的节点，...","posterSummary":" 仔细一想，我们只需要规避已经遍历过的子树，就能减少很多不必要的递归啦，那么要想知道已经遍历过哪些节点，就 可以使用一个 ”备忘录“ 记录下之前遍历过的节点，这样子一来后面遇到了重复的节点后只需要判断 ”备忘录“ 中是否已经出现过，就能规避到不必要的递归！","description":"","picture":"https://developer.qcloudimg.com/http-save/yehe-100000/04299020c269cd2879173dba5c874492.png","coverImageUrl":"https://developer.qcloudimg.com/http-save/yehe-100000/04299020c269cd2879173dba5c874492.png","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":10147998,"columnId":99139,"columnIds":[],"writeTime":1739585710,"updateTime":1739585710,"viewCount":70,"likeCount":1,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg","company":"","introduce":"心灵激情不在，就可能被打败！","isProfessionVerified":0,"nickname":"利刃大大","title":"","uid":10147998,"id":10147998,"name":"利刃大大","avatar":"https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg"},"tags":[{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17234,"tagName":"递归","id":17234,"name":"递归"},{"tagId":17244,"tagName":"动态规划","id":17244,"name":"动态规划"},{"tagId":17457,"tagName":"数组","id":17457,"name":"数组"},{"tagId":17459,"tagName":"搜索","id":17459,"name":"搜索"}]},{"id":2495976,"articleId":2495976,"title":"【floodfill深搜】太平洋大西洋水流问题 && 扫雷游戏 &&衣橱整理","content":"","plain":"","brief":"","summary":" 此时重点来了，我们遍历两个布尔值数组，判断两个数组中是否存在位置都为 true 的，存在的话说明从这个位置是可以同时流向两个洋，则添加到结果集中，如果不存在...","abstract":" 此时重点来了，我们遍历两个布尔值数组，判断两个数组中是否存在位置都为 true 的，存在的话说明从这个位置是可以同时流向两个洋，则添加到结果集中，如果不存在...","posterSummary":" 此时重点来了，我们遍历两个布尔值数组，判断两个数组中是否存在位置都为 true 的，存在的话说明从这个位置是可以同时流向两个洋，则添加到结果集中，如果不存在的话则不需要处理，最后返回结果集即可！","description":"","picture":"https://developer.qcloudimg.com/http-save/yehe-100000/e40d15d2330c4e6c3925ec110a43086a.png","coverImageUrl":"https://developer.qcloudimg.com/http-save/yehe-100000/e40d15d2330c4e6c3925ec110a43086a.png","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":10147998,"columnId":99139,"columnIds":[],"writeTime":1739411380,"updateTime":1739411380,"viewCount":54,"likeCount":1,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg","company":"","introduce":"心灵激情不在，就可能被打败！","isProfessionVerified":0,"nickname":"利刃大大","title":"","uid":10147998,"id":10147998,"name":"利刃大大","avatar":"https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg"},"tags":[{"tagId":17457,"tagName":"数组","id":17457,"name":"数组"},{"tagId":10666,"tagName":"游戏","id":10666,"name":"游戏"},{"tagId":14059,"tagName":"int","id":14059,"name":"int"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17234,"tagName":"递归","id":17234,"name":"递归"}]},{"id":2495866,"articleId":2495866,"title":"2025-02-11：合并两棵树后的最小直径。用go语言，给定两棵无向树，第一棵树有 n 个节点，第二棵树有 m 个节点，节点编","content":"","plain":"","brief":"","summary":"2.在 dfs 函数中，通过递归遍历树的节点，计算每个非父节点到根节点的最长路径。在遍历过程中更新直径的长度。","abstract":"2.在 dfs 函数中，通过递归遍历树的节点，计算每个非父节点到根节点的最长路径。在遍历过程中更新直径的长度。","posterSummary":"","description":"","picture":"https://developer.qcloudimg.com/http-save/10011/756f354da9d9036910df53c307d5549a.jpg","coverImageUrl":"https://developer.qcloudimg.com/http-save/10011/756f354da9d9036910df53c307d5549a.jpg","sourceType":99,"sourceDetail":{},"channelType":4,"channelDetail":{},"authorId":7620466,"columnId":88547,"columnIds":[],"writeTime":1739345821,"updateTime":1739345821,"viewCount":33,"likeCount":0,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/http-save/10011/4b93323c1bab6e531362f6c37b49d6b5.jpg","company":"北京动视元科技有限公司","introduce":"公众号：福大大架构师每日一题","isProfessionVerified":0,"nickname":"福大大架构师每日一题","title":"研发工程师","uid":7620466,"id":7620466,"name":"福大大架构师每日一题","avatar":"https://developer.qcloudimg.com/http-save/10011/4b93323c1bab6e531362f6c37b49d6b5.jpg"},"tags":[{"tagId":17358,"tagName":"连接","id":17358,"name":"连接"},{"tagId":14626,"tagName":"max","id":14626,"name":"max"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17234,"tagName":"递归","id":17234,"name":"递归"},{"tagId":17290,"tagName":"函数","id":17290,"name":"函数"}]},{"id":2495773,"articleId":2495773,"title":"《Go小技巧&易错点100例》第二十九篇","content":"","plain":"","brief":"","summary":"在旧版本中，需要手动遍历 slice 来求最大/最小值。而在 Go 1.21+ 中，slices.Max 和 slices.Min 让这件事变得更简单。","abstract":"在旧版本中，需要手动遍历 slice 来求最大/最小值。而在 Go 1.21+ 中，slices.Max 和 slices.Min 让这件事变得更简单。","posterSummary":"","description":"","picture":"https://developer.qcloudimg.com/http-save/10011/79330f407e0d2b4dfa9780adb3196a21.jpg","coverImageUrl":"https://developer.qcloudimg.com/http-save/10011/79330f407e0d2b4dfa9780adb3196a21.jpg","sourceType":99,"sourceDetail":{},"channelType":4,"channelDetail":{},"authorId":7215614,"columnId":97186,"columnIds":[],"writeTime":1739339854,"updateTime":1739339854,"viewCount":76,"likeCount":2,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/http-save/10011/9b57db9aa00d5388ac366ff00be64007.jpg","company":"公众号：扯编程的淡","introduce":"自由且澄净","isProfessionVerified":0,"nickname":"闫同学","title":"后端开发工程师","uid":7215614,"id":7215614,"name":"闫同学","avatar":"https://developer.qcloudimg.com/http-save/10011/9b57db9aa00d5388ac366ff00be64007.jpg"},"tags":[{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17290,"tagName":"函数","id":17290,"name":"函数"},{"tagId":17304,"tagName":"技巧","id":17304,"name":"技巧"},{"tagId":10174,"tagName":"go","id":10174,"name":"go"},{"tagId":14059,"tagName":"int","id":14059,"name":"int"}]},{"id":2495727,"articleId":2495727,"title":"【C++】二叉搜索树（搜索二叉树）","content":"","plain":"","brief":"","summary":" 本篇聊聊二叉搜索树，二叉树基本知识的详细讲解在【数据结构】二叉树 。","abstract":" 本篇聊聊二叉搜索树，二叉树基本知识的详细讲解在【数据结构】二叉树 。","posterSummary":"","description":"","picture":"https://developer.qcloudimg.com/http-save/yehe-100000/12938c9f2f3057fef38b7eda93a514d2.png","coverImageUrl":"https://developer.qcloudimg.com/http-save/yehe-100000/12938c9f2f3057fef38b7eda93a514d2.png","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":11323570,"columnId":103999,"columnIds":[],"writeTime":1739325662,"updateTime":1739325662,"viewCount":76,"likeCount":1,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/avatar/23570.png","company":"","introduce":"","isProfessionVerified":0,"nickname":"羚羊角","title":"","uid":11323570,"id":11323570,"name":"羚羊角","avatar":"https://developer.qcloudimg.com/avatar/23570.png"},"tags":[{"tagId":17440,"tagName":"数据","id":17440,"name":"数据"},{"tagId":17459,"tagName":"搜索","id":17459,"name":"搜索"},{"tagId":10166,"tagName":"c++","id":10166,"name":"c++"},{"tagId":10734,"tagName":"二叉树","id":10734,"name":"二叉树"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"}]},{"id":2495702,"articleId":2495702,"title":"【floodfill深搜】岛屿的最大面积 && 被围绕的区域","content":"","plain":"","brief":"","summary":" 这道题无非就是 200. 岛屿数量 的变形，从求岛屿个数变成求岛屿的最大面积，那么我们只需要做个小小调整，在遍历途中记录下面积，然后遍历完之后更新一下最大面...","abstract":" 这道题无非就是 200. 岛屿数量 的变形，从求岛屿个数变成求岛屿的最大面积，那么我们只需要做个小小调整，在遍历途中记录下面积，然后遍历完之后更新一下最大面...","posterSummary":" 这道题无非就是 200. 岛屿数量 的变形，从求岛屿个数变成求岛屿的最大面积，那么我们只需要做个小小调整，在遍历途中记录下面积，然后遍历完之后更新一下最大面积即可，非常简单！","description":"","picture":"https://developer.qcloudimg.com/http-save/yehe-100000/c9855f320967cd515cbdd9add4947bb8.png","coverImageUrl":"https://developer.qcloudimg.com/http-save/yehe-100000/c9855f320967cd515cbdd9add4947bb8.png","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":10147998,"columnId":99139,"columnIds":[],"writeTime":1739324341,"updateTime":1739324341,"viewCount":32,"likeCount":0,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg","company":"","introduce":"心灵激情不在，就可能被打败！","isProfessionVerified":0,"nickname":"利刃大大","title":"","uid":10147998,"id":10147998,"name":"利刃大大","avatar":"https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg"},"tags":[{"tagId":14059,"tagName":"int","id":14059,"name":"int"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17234,"tagName":"递归","id":17234,"name":"递归"},{"tagId":17457,"tagName":"数组","id":17457,"name":"数组"},{"tagId":13785,"tagName":"grid","id":13785,"name":"grid"}]},{"id":2495398,"articleId":2495398,"title":"10分钟-带你走进H5-五子棋","content":"","plain":"","brief":"","summary":"需要注意的是，想要修改 canvas标签的宽度和高度，不能直接在css中改，否则是拉伸canvas。只能在标签的属性上通过 width 和 height来改","abstract":"需要注意的是，想要修改 canvas标签的宽度和高度，不能直接在css中改，否则是拉伸canvas。只能在标签的属性上通过 width 和 height来改","posterSummary":"","description":"","picture":"https://developer.qcloudimg.com/http-save/yehe-100000/0be46734b59e230083677c254f0949d0.webp","coverImageUrl":"https://developer.qcloudimg.com/http-save/yehe-100000/0be46734b59e230083677c254f0949d0.webp","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":1614009,"columnId":104797,"columnIds":[],"writeTime":1739254311,"updateTime":1739254311,"viewCount":99,"likeCount":1,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/http-save/10011/6bb87b4fd171a539099b6253723a025a.jpg","company":"","introduce":"","isProfessionVerified":0,"nickname":"万少","title":"","uid":1614009,"id":1614009,"name":"万少","avatar":"https://developer.qcloudimg.com/http-save/10011/6bb87b4fd171a539099b6253723a025a.jpg"},"tags":[{"tagId":17429,"tagName":"事件","id":17429,"name":"事件"},{"tagId":17457,"tagName":"数组","id":17457,"name":"数组"},{"tagId":17470,"tagName":"统计","id":17470,"name":"统计"},{"tagId":10847,"tagName":"canvas","id":10847,"name":"canvas"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"}]},{"id":2495378,"articleId":2495378,"title":"【数据结构】二叉树","content":"","plain":"","brief":"","summary":"学习二叉树结构，最简单的方式就是遍历。所谓二叉树遍历(Traversal)是按照某种特定的规则，依次对二叉树中的结点进行相应的操作，并且每个结点只操作一次。","abstract":"学习二叉树结构，最简单的方式就是遍历。所谓二叉树遍历(Traversal)是按照某种特定的规则，依次对二叉树中的结点进行相应的操作，并且每个结点只操作一次。","posterSummary":"","description":"","picture":"https://developer.qcloudimg.com/http-save/yehe-100000/072870798716589935d00ed6ff5ecabf.png","coverImageUrl":"https://developer.qcloudimg.com/http-save/yehe-100000/072870798716589935d00ed6ff5ecabf.png","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":11323570,"columnId":103999,"columnIds":[],"writeTime":1739253819,"updateTime":1739253819,"viewCount":62,"likeCount":1,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/avatar/23570.png","company":"","introduce":"","isProfessionVerified":0,"nickname":"羚羊角","title":"","uid":11323570,"id":11323570,"name":"羚羊角","avatar":"https://developer.qcloudimg.com/avatar/23570.png"},"tags":[{"tagId":10734,"tagName":"二叉树","id":10734,"name":"二叉树"},{"tagId":10812,"tagName":"数据结构","id":10812,"name":"数据结构"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17247,"tagName":"队列","id":17247,"name":"队列"},{"tagId":17457,"tagName":"数组","id":17457,"name":"数组"}]},{"id":2495333,"articleId":2495333,"title":"【floodfill深搜】岛屿数量 && 岛屿的最大面积","content":"","plain":"","brief":"","summary":" 给你一个由 '1'（陆地）和 '0'（水）组成的的二维网格，请你计算网格中岛屿的数量。","abstract":" 给你一个由 '1'（陆地）和 '0'（水）组成的的二维网格，请你计算网格中岛屿的数量。","posterSummary":"","description":"","picture":"https://developer.qcloudimg.com/http-save/yehe-100000/baa12027cc3aadc88bff6ebcb30a7ae4.png","coverImageUrl":"https://developer.qcloudimg.com/http-save/yehe-100000/baa12027cc3aadc88bff6ebcb30a7ae4.png","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":10147998,"columnId":99139,"columnIds":[],"writeTime":1739250872,"updateTime":1739250872,"viewCount":44,"likeCount":0,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg","company":"","introduce":"心灵激情不在，就可能被打败！","isProfessionVerified":0,"nickname":"利刃大大","title":"","uid":10147998,"id":10147998,"name":"利刃大大","avatar":"https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg"},"tags":[{"tagId":10576,"tagName":"渲染","id":10576,"name":"渲染"},{"tagId":13785,"tagName":"grid","id":13785,"name":"grid"},{"tagId":14059,"tagName":"int","id":14059,"name":"int"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17234,"tagName":"递归","id":17234,"name":"递归"}]},{"id":2495303,"articleId":2495303,"title":"Java-线索二叉树的实现","content":"","plain":"","brief":"","summary":"","abstract":"","posterSummary":"","description":"","picture":"","coverImageUrl":"","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":1650713,"columnId":104826,"columnIds":[],"writeTime":1739249787,"updateTime":1739249787,"viewCount":43,"likeCount":1,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png","company":"","introduce":"","isProfessionVerified":0,"nickname":"leehao","title":"","uid":1650713,"id":1650713,"name":"leehao","avatar":"https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png"},"tags":[{"tagId":10734,"tagName":"二叉树","id":10734,"name":"二叉树"},{"tagId":15429,"tagName":"public","id":15429,"name":"public"},{"tagId":15764,"tagName":"root","id":15764,"name":"root"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":10164,"tagName":"java","id":10164,"name":"java"}]},{"id":2495301,"articleId":2495301,"title":"Java-二叉树-插入、删除、遍历","content":"","plain":"","brief":"","summary":"","abstract":"","posterSummary":"","description":"","picture":"","coverImageUrl":"","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":1650713,"columnId":104826,"columnIds":[],"writeTime":1739249762,"updateTime":1739249762,"viewCount":78,"likeCount":1,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png","company":"","introduce":"","isProfessionVerified":0,"nickname":"leehao","title":"","uid":1650713,"id":1650713,"name":"leehao","avatar":"https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png"},"tags":[{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":10164,"tagName":"java","id":10164,"name":"java"},{"tagId":10734,"tagName":"二叉树","id":10734,"name":"二叉树"},{"tagId":15429,"tagName":"public","id":15429,"name":"public"},{"tagId":15764,"tagName":"root","id":15764,"name":"root"}]},{"id":2495299,"articleId":2495299,"title":"Java--消除重复数字后的最大值","content":"","plain":"","brief":"","summary":"42234，消除4 得到4223 或者 2234 ，再消除2，得到423或234，取最大值423","abstract":"42234，消除4 得到4223 或者 2234 ，再消除2，得到423或234，取最大值423","posterSummary":"","description":"","picture":"","coverImageUrl":"","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":1650713,"columnId":104826,"columnIds":[],"writeTime":1739249645,"updateTime":1739249645,"viewCount":27,"likeCount":0,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png","company":"","introduce":"","isProfessionVerified":0,"nickname":"leehao","title":"","uid":1650713,"id":1650713,"name":"leehao","avatar":"https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png"},"tags":[{"tagId":17460,"tagName":"算法","id":17460,"name":"算法"},{"tagId":10164,"tagName":"java","id":10164,"name":"java"},{"tagId":14493,"tagName":"list","id":14493,"name":"list"},{"tagId":16227,"tagName":"stack","id":16227,"name":"stack"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"}]},{"id":2495295,"articleId":2495295,"title":"Java-约瑟夫问题（Josephus Problem）","content":"","plain":"","brief":"","summary":"据说着名犹太历史学家 Josephus有过以下的故事：在罗马人占领乔塔帕特后，39 个犹太人与Josephus及他的朋友躲到一个洞中，39个犹太人决定宁愿死也不...","abstract":"据说着名犹太历史学家 Josephus有过以下的故事：在罗马人占领乔塔帕特后，39 个犹太人与Josephus及他的朋友躲到一个洞中，39个犹太人决定宁愿死也不...","posterSummary":"据说着名犹太历史学家 Josephus有过以下的故事：在罗马人占领乔塔帕特后，39 个犹太人与Josephus及他的朋友躲到一个洞中，39个犹太人决定宁愿死也不要被敌人到，于是决定了一个自杀方式，41个人排成一个圆圈，由第1个人 开始报数，每报数到第3人该人就必须自杀，然后再由下一个重新报数，直到所有人都自杀身亡为止。","description":"","picture":"","coverImageUrl":"","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":1650713,"columnId":104826,"columnIds":[],"writeTime":1739249538,"updateTime":1739249538,"viewCount":48,"likeCount":0,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png","company":"","introduce":"","isProfessionVerified":0,"nickname":"leehao","title":"","uid":1650713,"id":1650713,"name":"leehao","avatar":"https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png"},"tags":[{"tagId":17188,"tagName":"变量","id":17188,"name":"变量"},{"tagId":17457,"tagName":"数组","id":17457,"name":"数组"},{"tagId":10164,"tagName":"java","id":10164,"name":"java"},{"tagId":10666,"tagName":"游戏","id":10666,"name":"游戏"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"}]},{"id":2495294,"articleId":2495294,"title":"KTV","content":"","plain":"","brief":"","summary":"有n个人去KTV唱歌，每个人都有自己想唱的一些歌曲。已知该KTV的每个房间都只有x个麦克风，同一首歌可以同时多个人一起唱，但是同时唱的人不能超过x个人，同一时刻...","abstract":"有n个人去KTV唱歌，每个人都有自己想唱的一些歌曲。已知该KTV的每个房间都只有x个麦克风，同一首歌可以同时多个人一起唱，但是同时唱的人不能超过x个人，同一时刻...","posterSummary":"有n个人去KTV唱歌，每个人都有自己想唱的一些歌曲。已知该KTV的每个房间都只有x个麦克风，同一首歌可以同时多个人一起唱，但是同时唱的人不能超过x个人，同一时刻只能唱一首歌。一共只有y首歌的时间，所有人想唱的歌都唱完或者y首歌唱完了他们就会离开。他们想知道在最优的安排策略下（让每个人尽量唱完自己想唱的歌曲），当他们离开时是否还有人有想唱但没唱的歌曲。","description":"","picture":"","coverImageUrl":"","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":1650713,"columnId":104826,"columnIds":[],"writeTime":1739249517,"updateTime":1739249517,"viewCount":47,"likeCount":0,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png","company":"","introduce":"","isProfessionVerified":0,"nickname":"leehao","title":"","uid":1650713,"id":1650713,"name":"leehao","avatar":"https://ask.qcloudimg.com/avatar/1650713/ewjyqexdr1.png"},"tags":[{"tagId":17440,"tagName":"数据","id":17440,"name":"数据"},{"tagId":17457,"tagName":"数组","id":17457,"name":"数组"},{"tagId":14059,"tagName":"int","id":14059,"name":"int"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17205,"tagName":"测试","id":17205,"name":"测试"}]},{"id":2494894,"articleId":2494894,"title":"2025-02-08：找出有效子序列的最大长度Ⅰ。用go语言，给定一个整数数组 nums，我们需要找出其最长的“有效子序列”的长","content":"","plain":"","brief":"","summary":"2025-02-08：找出有效子序列的最大长度Ⅰ。用go语言，给定一个整数数组 nums，我们需要找出其最长的“有效子序列”的长度。有效子序列的定义为：一个长度...","abstract":"2025-02-08：找出有效子序列的最大长度Ⅰ。用go语言，给定一个整数数组 nums，我们需要找出其最长的“有效子序列”的长度。有效子序列的定义为：一个长度...","posterSummary":"2025-02-08：找出有效子序列的最大长度Ⅰ。用go语言，给定一个整数数组 nums，我们需要找出其最长的“有效子序列”的长度。有效子序列的定义为：一个长度为 x 的子序列需要满足以下条件：对于子序列中的任意连续两个元素，前两个元素之和的奇偶性（即 (sub[i] + sub[i+1]) % 2）在整个子序列中保持一致。也就是说，所有相邻元素之和的奇偶性都应该相同。","description":"","picture":"https://developer.qcloudimg.com/http-save/10011/bd2793373f7adc8bfef687f834ac36ae.jpg","coverImageUrl":"https://developer.qcloudimg.com/http-save/10011/bd2793373f7adc8bfef687f834ac36ae.jpg","sourceType":99,"sourceDetail":{},"channelType":4,"channelDetail":{},"authorId":7620466,"columnId":88547,"columnIds":[],"writeTime":1739172254,"updateTime":1739172254,"viewCount":32,"likeCount":0,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/http-save/10011/4b93323c1bab6e531362f6c37b49d6b5.jpg","company":"北京动视元科技有限公司","introduce":"公众号：福大大架构师每日一题","isProfessionVerified":0,"nickname":"福大大架构师每日一题","title":"研发工程师","uid":7620466,"id":7620466,"name":"福大大架构师每日一题","avatar":"https://developer.qcloudimg.com/http-save/10011/4b93323c1bab6e531362f6c37b49d6b5.jpg"},"tags":[{"tagId":10665,"tagName":"存储","id":10665,"name":"存储"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17188,"tagName":"变量","id":17188,"name":"变量"},{"tagId":17290,"tagName":"函数","id":17290,"name":"函数"},{"tagId":17457,"tagName":"数组","id":17457,"name":"数组"}]},{"id":2494893,"articleId":2494893,"title":"2025-02-09：找出有效子序列的最大长度Ⅱ。用go语言，给定一个整数数组 nums 和一个正整数 k，我们定义一个子序列","content":"","plain":"","brief":"","summary":"2025-02-09：找出有效子序列的最大长度Ⅱ。用go语言，给定一个整数数组 nums 和一个正整数 k，我们定义一个子序列 sub 的长度为 x，如果满足以...","abstract":"2025-02-09：找出有效子序列的最大长度Ⅱ。用go语言，给定一个整数数组 nums 和一个正整数 k，我们定义一个子序列 sub 的长度为 x，如果满足以...","posterSummary":"2025-02-09：找出有效子序列的最大长度Ⅱ。用go语言，给定一个整数数组 nums 和一个正整数 k，我们定义一个子序列 sub 的长度为 x，如果满足以下条件，则称为有效子序列：","description":"","picture":"https://developer.qcloudimg.com/http-save/10011/394cff59e929cfa6b1adc33ea39b7c3e.jpg","coverImageUrl":"https://developer.qcloudimg.com/http-save/10011/394cff59e929cfa6b1adc33ea39b7c3e.jpg","sourceType":99,"sourceDetail":{},"channelType":4,"channelDetail":{},"authorId":7620466,"columnId":88547,"columnIds":[],"writeTime":1739172232,"updateTime":1739172232,"viewCount":64,"likeCount":1,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/http-save/10011/4b93323c1bab6e531362f6c37b49d6b5.jpg","company":"北京动视元科技有限公司","introduce":"公众号：福大大架构师每日一题","isProfessionVerified":0,"nickname":"福大大架构师每日一题","title":"研发工程师","uid":7620466,"id":7620466,"name":"福大大架构师每日一题","avatar":"https://developer.qcloudimg.com/http-save/10011/4b93323c1bab6e531362f6c37b49d6b5.jpg"},"tags":[{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17457,"tagName":"数组","id":17457,"name":"数组"},{"tagId":14059,"tagName":"int","id":14059,"name":"int"},{"tagId":14626,"tagName":"max","id":14626,"name":"max"},{"tagId":15731,"tagName":"return","id":15731,"name":"return"}]},{"id":2494843,"articleId":2494843,"title":"【floodfill深搜】图像渲染，这题不来试试？","content":"","plain":"","brief":"","summary":" 而对于 floodfill 算法，用 深度优先遍历和广度优先遍历 都是可以处理的，我们这里就以深度优先遍历为例展开叙述！","abstract":" 而对于 floodfill 算法，用 深度优先遍历和广度优先遍历 都是可以处理的，我们这里就以深度优先遍历为例展开叙述！","posterSummary":"","description":"","picture":"https://developer.qcloudimg.com/http-save/yehe-100000/c834b857bd45ac261ee7e049cace91be.png","coverImageUrl":"https://developer.qcloudimg.com/http-save/yehe-100000/c834b857bd45ac261ee7e049cace91be.png","sourceType":99,"sourceDetail":{},"channelType":2,"channelDetail":{},"authorId":10147998,"columnId":99139,"columnIds":[],"writeTime":1739168345,"updateTime":1739168345,"viewCount":39,"likeCount":0,"commentCount":0,"favorCount":0,"weight":0,"status":2,"draftId":0,"tagIds":[],"isCommentEnable":true,"highQuality":false,"skipAds":false,"showAds":false,"focusRead":false,"publishTime":null,"editTime":null,"isCloseTextLink":false,"author":{"avatarUrl":"https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg","company":"","introduce":"心灵激情不在，就可能被打败！","isProfessionVerified":0,"nickname":"利刃大大","title":"","uid":10147998,"id":10147998,"name":"利刃大大","avatar":"https://developer.qcloudimg.com/http-save/10011/c769668bf137636467b9327550de9279.jpg"},"tags":[{"tagId":13990,"tagName":"image","id":13990,"name":"image"},{"tagId":17187,"tagName":"遍历","id":17187,"name":"遍历"},{"tagId":17234,"tagName":"递归","id":17234,"name":"递归"},{"tagId":17460,"tagName":"算法","id":17460,"name":"算法"},{"tagId":10576,"tagName":"渲染","id":10576,"name":"渲染"}]}]},"video":{"fetchStatus":"none","done":false,"nextPageNumber":1,"pageSize":20,"total":0,"list":[]}},"relatedProducts":[],"relatedDevdocs":[],"activeUsers":[],"hotColumns":[{"id":1165,"name":"饶文津的专栏","desc":"","icon":"https://imgcache.qq.com/qcloud/developer/images/release/column-icons/13.png","background":"","status":2,"creatorId":903492,"memberCount":1,"articleCount":478,"followCount":35,"createdTime":1492067144,"creator":{"id":903492,"uid":903492,"name":"饶文津","label":"","avatar":"https://ask.qcloudimg.com/avatar/female/rkclsi9ZHum.png","province":"","city":"","company":"","title":"","school":"","major":"","homePage":"","region":1,"jobType":1,"graduationDate":"","education":0,"specialityIds":[10308],"specialities":[],"gender":1,"trade":"","growthLevel":0,"isProfessionVerified":false,"upvoteCount":0,"followingCount":3,"followerCount":21,"questionCount":0,"answerCount":1,"followQuestionCount":0,"followTagCount":0,"favorAnswerCount":0,"beHandPickedCount":0,"followColumnCount":2,"articleCount":478,"validArticleCount":478}},{"id":1283,"name":"腾讯技术工程官方号的专栏","desc":"","icon":"https://ask.qcloudimg.com/column-icons/1283/170434/hcgwwmih7d.jpg","background":"","status":2,"creatorId":170434,"memberCount":2,"articleCount":1119,"followCount":921,"createdTime":1496643325,"creator":{"id":170434,"uid":170434,"name":"腾讯技术工程官方号","label":"腾讯技术工程事业群官方微信公众号","avatar":"https://ask.qcloudimg.com/http-save/yehe-170434/568f3e8410f6654284c65b8e886345e3.png","province":"1213","city":"1216","company":"腾讯","title":"产品经理","school":"","major":"","homePage":"","region":1,"jobType":1,"graduationDate":"","education":0,"specialityIds":[10539,10244,10149,10333,10245],"specialities":[],"gender":1,"trade":"","growthLevel":0,"isProfessionVerified":true,"upvoteCount":0,"followingCount":1,"followerCount":1600,"questionCount":0,"answerCount":0,"followQuestionCount":0,"followTagCount":0,"favorAnswerCount":0,"beHandPickedCount":0,"followColumnCount":2,"articleCount":1122,"validArticleCount":1119}},{"id":1362,"name":"微信终端开发团队的专栏","desc":"","icon":"https://imgcache.qq.com/qcloud/developer/images/release/column-icons/17.png","background":"","status":2,"creatorId":598196,"memberCount":2,"articleCount":111,"followCount":517,"createdTime":1500514978,"creator":{"id":598196,"uid":598196,"name":"微信终端开发团队","label":"","avatar":"https://ask.qcloudimg.com/http-save/yehe-598196/3af616d0f6d7dd025d79e3d85a644644.png","province":"","city":"","company":"","title":"","school":"","major":"","homePage":"","region":1,"jobType":1,"graduationDate":"","education":0,"specialityIds":[10216,10151,10244,10541,10539],"specialities":[],"gender":1,"trade":"","growthLevel":0,"isProfessionVerified":false,"upvoteCount":0,"followingCount":1,"followerCount":580,"questionCount":0,"answerCount":0,"followQuestionCount":0,"followTagCount":0,"favorAnswerCount":0,"beHandPickedCount":0,"followColumnCount":2,"articleCount":111,"validArticleCount":111}},{"id":1551,"name":"腾讯云数据库(TencentDB)","desc":"数据库","icon":"https://ask.qcloudimg.com/column-icons/1551/1002332/2yc9i3hsmr.jpg","background":"","status":2,"creatorId":1002332,"memberCount":3,"articleCount":863,"followCount":405,"createdTime":1511426102,"creator":{"id":1002332,"uid":1002332,"name":"腾讯云数据库 TencentDB","label":"腾讯云数据库（TencentDB)。","avatar":"https://ask.qcloudimg.com/developer-images/custom-avatar/1002332/ep9vu2jcbd.jpg","province":"1213","city":"1216","company":"腾讯云","title":"产品团队","school":"","major":"","homePage":"","region":1,"jobType":1,"graduationDate":"","education":0,"specialityIds":[10244,10245,10253,10249,10537],"specialities":[],"gender":1,"trade":"website_new","growthLevel":0,"isProfessionVerified":true,"upvoteCount":0,"followingCount":2,"followerCount":647,"questionCount":2,"answerCount":54,"followQuestionCount":0,"followTagCount":0,"favorAnswerCount":0,"beHandPickedCount":1,"followColumnCount":7,"articleCount":863,"validArticleCount":863}}],"recommendedTags":[],"env":"production","documentBaseTitle":"腾讯云开发者社区-腾讯云","cdnDomain":"cloudcache.tencent-cloud.cn","cssDomain":"cloudcache.tencent-cloud.cn","qcloudDomain":"cloud.tencent.com","consoleDomain":"console.cloud.tencent.com","qcommunity_identify_id":"JvUyzD7rminY9iqhM9v_E","session":{"isLogined":false,"isQcloudUser":false,"isOwner":false,"nickname":"","accountInfoCompleted":false,"phoneCompleted":false,"profile":{},"contactPhoneCompleted":false,"userInfo":{}},"pvId":"JeX64BswnRdBMhmh2VMB5","userIp":"8.222.208.146","fromMiniProgram":false,"route":{"url":"/developer/tag/17187","path":"/developer/tag/17187","pathname":"/developer/tag/17187","search":null,"query":{},"segments":["developer","tag","17187"]}}); </script><script class=""> if (!Element.prototype.matches) Element.prototype.matches = Element.prototype.msMatchesSelector || Element.prototype.webkitMatchesSelector; if (!Element.prototype.closest) Element.prototype.closest = function(s) { var el = this; if (!document.documentElement.contains(el)) return null; do { if (el.matches(s)) return el; el = el.parentElement; } while (el !== null); return null; }; window.addEventListener('mouseover', function(evt) { const target = evt.target; if (!target) { return; } const aEle = target.closest('a'); if (!aEle) { return; } let href = aEle.getAttribute('href'); if (!href) { return; } href = href.replace(/cloud.tencent.com.cn|cloud.tencent.com|cloud.tencent.cn/g, 'cloud.tencent.com'); aEle.setAttribute('href', href); }, true); </script></body></html>