<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <author>
    <name>蔚蓝WEILANX</name>
  </author>
  <generator uri="https://hexo.io/">Hexo</generator>
  <id>https://blog.weilanx.com/</id>
  <link href="https://blog.weilanx.com/" rel="alternate"/>
  <link href="https://blog.weilanx.com/atom.xml" rel="self"/>
  <rights>All rights reserved 2026, 蔚蓝WEILANX</rights>
  <subtitle>保持热爱，保持思考</subtitle>
  <title>蔚蓝博客</title>
  <updated>2026-05-25T15:35:09.142Z</updated>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="AI 技术栈" scheme="https://blog.weilanx.com/categories/AI-%E6%8A%80%E6%9C%AF%E6%A0%88/"/>
    <category term="ClaudeCode" scheme="https://blog.weilanx.com/tags/ClaudeCode/"/>
    <category term="浏览器插件" scheme="https://blog.weilanx.com/tags/%E6%B5%8F%E8%A7%88%E5%99%A8%E6%8F%92%E4%BB%B6/"/>
    <category term="AI" scheme="https://blog.weilanx.com/tags/AI/"/>
    <id>https://blog.weilanx.com/posts/DgP7/</id>
    <link href="https://blog.weilanx.com/posts/DgP7/"/>
    <published>2026-05-25T15:35:09.142Z</published>
    <summary>
      <![CDATA[<blockquote>
<p>我平时使用 Chrome 经常开着三四十个标签，找一个东西要在标签栏上来回扫，眼都花了，而且非常影响效率，这是一个真实存在的痛点，并且困扰我很久了。
一天后后：一个跑在我浏览器里的扩展，按域名把所有标签摊成瀑布卡，一眼能看到哪个站开太多了。
关键的]]>
    </summary>
    <title>我没写一行代码，飞书里聊出了一个 Chrome 扩展</title>
    <updated>2026-05-25T15:35:09.142Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="UIUX" scheme="https://blog.weilanx.com/categories/UIUX/"/>
    <category term="UI" scheme="https://blog.weilanx.com/tags/UI/"/>
    <category term="ClaudeCode" scheme="https://blog.weilanx.com/tags/ClaudeCode/"/>
    <category term="OpanDesign" scheme="https://blog.weilanx.com/tags/OpanDesign/"/>
    <id>https://blog.weilanx.com/posts/ub2U/</id>
    <link href="https://blog.weilanx.com/posts/ub2U/"/>
    <published>2026-05-24T15:45:16.807Z</published>
    <summary>
      <![CDATA[<p><img src="https://eo.cos.weilanx.com/blog-static/assets/posts/ub2U/image-3c2ed25e07aab99d.png" alt="image.png"></p>
<h1 id="Open-Design-实]]>
    </summary>
    <title>Open Design 实战：从 AI 驱动设计到代码全流程实现</title>
    <updated>2026-05-24T15:45:16.807Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="AI 技术栈" scheme="https://blog.weilanx.com/categories/AI-%E6%8A%80%E6%9C%AF%E6%A0%88/"/>
    <category term="ClaudeCode" scheme="https://blog.weilanx.com/tags/ClaudeCode/"/>
    <id>https://blog.weilanx.com/posts/7BdA/</id>
    <link href="https://blog.weilanx.com/posts/7BdA/"/>
    <published>2026-05-23T12:57:41.118Z</published>
    <summary>
      <![CDATA[<p>最近看到zara老师发的一个飞书连接claude code的视频，突然冒出一个念头——既然 Claude Code 都在我电脑上跑了，那能不能让它跑在云服务器上，然后我用飞书发消息就能让它干活？想到哪算哪，说改个 bug 就改 bug，说部个署就部署,整个云服务器变成我的数]]>
    </summary>
    <title>我把 Claude Code 接到了飞书里，现在躺在床上发条消息就能让 AI 部署网站</title>
    <updated>2026-05-23T12:57:41.118Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="算法笔记" scheme="https://blog.weilanx.com/categories/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0/"/>
    <category term="Java" scheme="https://blog.weilanx.com/tags/Java/"/>
    <category term="算法" scheme="https://blog.weilanx.com/tags/%E7%AE%97%E6%B3%95/"/>
    <id>https://blog.weilanx.com/posts/sr8H/</id>
    <link href="https://blog.weilanx.com/posts/sr8H/"/>
    <published>2026-04-19T04:59:51.198Z</published>
    <summary>
      <![CDATA[<p>哈喽，大家好呀，我是蔚蓝～，今天我们来聊 LeetCode Hot 100 的二分查找。</p>
<p>你查过字典吗？不是手机上那种输入法自动补全，是真的翻一本厚厚的纸质字典。</p>
<p>翻到中间，看一下，字母在左边就翻左边，在右边就翻右边。每次把搜索范围砍掉一半。</]]>
    </summary>
    <title>LeetCode Hot 100 二分查找篇 - 每次砍一半，六道题从入门到穿透</title>
    <updated>2026-04-19T04:59:51.198Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="算法笔记" scheme="https://blog.weilanx.com/categories/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0/"/>
    <category term="算法" scheme="https://blog.weilanx.com/tags/%E7%AE%97%E6%B3%95/"/>
    <category term="二叉树" scheme="https://blog.weilanx.com/tags/%E4%BA%8C%E5%8F%89%E6%A0%91/"/>
    <category term="递归" scheme="https://blog.weilanx.com/tags/%E9%80%92%E5%BD%92/"/>
    <id>https://blog.weilanx.com/posts/k4KG/</id>
    <link href="https://blog.weilanx.com/posts/k4KG/"/>
    <published>2026-04-17T10:54:06.785Z</published>
    <summary>
      <![CDATA[<p>哈喽，大家好呀，我是蔚蓝，今天我们来聊聊二叉树。</p>
<p>你有没有过这种体验？打开 LeetCode，信心满满地点开一道二叉树的题，结果盯着屏幕半天，递归函数写了删、删了写，脑子里一团浆糊——这个返回值到底该是 <code>int</code> 还是 <code>Tr]]>
    </summary>
    <title>二叉树通关指南：用递归五部曲拆解七大类型</title>
    <updated>2026-04-17T10:54:06.785Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="算法笔记" scheme="https://blog.weilanx.com/categories/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0/"/>
    <category term="回溯" scheme="https://blog.weilanx.com/tags/%E5%9B%9E%E6%BA%AF/"/>
    <category term="DFS" scheme="https://blog.weilanx.com/tags/DFS/"/>
    <category term="排列组合" scheme="https://blog.weilanx.com/tags/%E6%8E%92%E5%88%97%E7%BB%84%E5%90%88/"/>
    <id>https://blog.weilanx.com/posts/Rre2/</id>
    <link href="https://blog.weilanx.com/posts/Rre2/"/>
    <published>2026-03-18T13:16:33.821Z</published>
    <summary>
      <![CDATA[<p>哈喽，大家好呀，我是 Leo，今天我们来聊聊回溯算法,一个听起来很玄乎，其实就是”走不通就回头”的朴素思想。</p>
<p>你有没有过这样的经历？走进一个复杂的迷宫，选了一条路走下去，发现是死胡同，于是退回来，换另一条路再试。这不就是回溯吗？</p>
<p><strong>]]>
    </summary>
    <title>回溯算法：从迷宫探索到解题套路</title>
    <updated>2026-03-18T13:16:33.821Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="算法笔记" scheme="https://blog.weilanx.com/categories/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0/"/>
    <category term="DFS" scheme="https://blog.weilanx.com/tags/DFS/"/>
    <category term="BFS" scheme="https://blog.weilanx.com/tags/BFS/"/>
    <category term="图论" scheme="https://blog.weilanx.com/tags/%E5%9B%BE%E8%AE%BA/"/>
    <category term="岛屿问题" scheme="https://blog.weilanx.com/tags/%E5%B2%9B%E5%B1%BF%E9%97%AE%E9%A2%98/"/>
    <id>https://blog.weilanx.com/posts/wMf3/</id>
    <link href="https://blog.weilanx.com/posts/wMf3/"/>
    <published>2026-03-15T06:11:05.341Z</published>
    <summary>
      <![CDATA[<p>哈喽，大家好呀，我是蔚蓝，今天我们来聊聊算法面试里的「岛屿问题」。</p>
<p>你有没有遇到过这种情况：刷 LeetCode 的时候，看到岛屿数量、最大面积、孤岛总面积这些题，感觉都差不多，但每次写都要重新想一遍逻辑，代码写得磕磕绊绊，面试的时候更是容易慌。</p>
<p]]>
    </summary>
    <title>岛屿问题:三步走模板秒杀 8 道经典变体</title>
    <updated>2026-03-15T06:14:40.929Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="AI 技术栈" scheme="https://blog.weilanx.com/categories/AI-%E6%8A%80%E6%9C%AF%E6%A0%88/"/>
    <category term="LLM" scheme="https://blog.weilanx.com/tags/LLM/"/>
    <category term="RAG" scheme="https://blog.weilanx.com/tags/RAG/"/>
    <category term="知识图谱" scheme="https://blog.weilanx.com/tags/%E7%9F%A5%E8%AF%86%E5%9B%BE%E8%B0%B1/"/>
    <id>https://blog.weilanx.com/posts/xpoS/</id>
    <link href="https://blog.weilanx.com/posts/xpoS/"/>
    <published>2026-03-14T11:45:32.418Z</published>
    <summary>
      <![CDATA[<p>哈喽，大家好呀，我是蔚蓝，今天我们来聊聊知识图谱——一个在 AI 时代被反复提及，但真正落地时让人抓耳挠腮的技术。</p>
<p>这事儿得从我做 DeepForest 林业智能问答系统说起。项目做完后去面试，面试官盯着简历上的「知识图谱」四个字，问题一个接一个：Schema]]>
    </summary>
    <title>从零构建20万节点林业知识图谱：一次被面试官问怕了的技术探险</title>
    <updated>2026-03-14T11:53:58.034Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="算法笔记" scheme="https://blog.weilanx.com/categories/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0/"/>
    <category term="算法" scheme="https://blog.weilanx.com/tags/%E7%AE%97%E6%B3%95/"/>
    <category term="滑动窗口" scheme="https://blog.weilanx.com/tags/%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3/"/>
    <category term="双指针" scheme="https://blog.weilanx.com/tags/%E5%8F%8C%E6%8C%87%E9%92%88/"/>
    <id>https://blog.weilanx.com/posts/2eYS/</id>
    <link href="https://blog.weilanx.com/posts/2eYS/"/>
    <published>2026-03-13T15:44:06.154Z</published>
    <summary>
      <![CDATA[<p>哈喽，大家好呀，我是蔚蓝 ，今天我们来聊聊面试中出场率最高的两个算法技巧：滑动窗口和双指针。</p>
<p>LeetCode 提交页面，红色的「Time Limit Exceeded」。</p>
<p>你写过两层 for 循环嵌套吗？逻辑没问题，就是跑不完。</p>
<p>]]>
    </summary>
    <title>滑动窗口与双指针：把 O(n²) 降维成 O(n) 的魔法</title>
    <updated>2026-03-13T15:44:06.154Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="MySQL" scheme="https://blog.weilanx.com/categories/MySQL/"/>
    <category term="锁" scheme="https://blog.weilanx.com/tags/%E9%94%81/"/>
    <category term="并发" scheme="https://blog.weilanx.com/tags/%E5%B9%B6%E5%8F%91/"/>
    <id>https://blog.weilanx.com/posts/Q7AU/</id>
    <link href="https://blog.weilanx.com/posts/Q7AU/"/>
    <published>2026-03-08T10:54:58.347Z</published>
    <summary>
      <![CDATA[<p>哈喽，大家好呀，我是蔚蓝🥰，今天我们来深入拆解一下 MySQL 的锁机制。</p>
<p>很多同学在面对 MySQL 锁的时候，往往感觉是一团乱麻：一会儿是表锁、一会儿是行锁；转头又冒出个间隙锁、临键锁；甚至还有听起来玄而又玄的「意向锁」。</p>
<p>如果你曾经被「死]]>
    </summary>
    <title>MySQL 并发之王：深度拆解 MySQL 各种锁及其面试通关指南</title>
    <updated>2026-03-08T10:56:17.621Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="算法笔记" scheme="https://blog.weilanx.com/categories/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0/"/>
    <category term="Java" scheme="https://blog.weilanx.com/tags/Java/"/>
    <category term="动态规划" scheme="https://blog.weilanx.com/tags/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/"/>
    <category term="编辑距离" scheme="https://blog.weilanx.com/tags/%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB/"/>
    <category term="序列" scheme="https://blog.weilanx.com/tags/%E5%BA%8F%E5%88%97/"/>
    <id>https://blog.weilanx.com/posts/VrXp/</id>
    <link href="https://blog.weilanx.com/posts/VrXp/"/>
    <published>2026-03-08T07:19:34.727Z</published>
    <summary>
      <![CDATA[<p>哈喽，大家好呀，我是蔚蓝🥰，今天我们来深入聊聊动态规划里的「硬骨头」：<strong>序列与编辑距离系列</strong>。</p>
<p>不知道大家在刷 LeetCode 或者准备考研机试的时候，有没有被这几种题目绕晕过：这道题到底要不要连续？两个子序列怎么比？编辑距离]]>
    </summary>
    <title>
      <![CDATA[序列&编辑距离：从基础递推到跨表匹配]]>
    </title>
    <updated>2026-03-08T07:24:06.089Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="算法笔记" scheme="https://blog.weilanx.com/categories/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0/"/>
    <category term="Java" scheme="https://blog.weilanx.com/tags/Java/"/>
    <category term="动态规划" scheme="https://blog.weilanx.com/tags/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/"/>
    <category term="打家劫舍" scheme="https://blog.weilanx.com/tags/%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D/"/>
    <id>https://blog.weilanx.com/posts/KW5m/</id>
    <link href="https://blog.weilanx.com/posts/KW5m/"/>
    <published>2026-03-06T06:07:54.284Z</published>
    <summary>
      <![CDATA[<p>哈喽，大家好呀，我是蔚蓝🥰！今天我们来聊聊 DP 专题里最像「犯罪现场模拟」的一个系列——<strong>打家劫舍 (House Robber)</strong>。</p>
<p>很多小伙伴刚接触动态规划时，觉得这题挺逗，怎么还教人「偷东西」呢？其实，这道题的精髓不在于「]]>
    </summary>
    <title>打家劫舍：从线性到树形，彻底玩转动态规划</title>
    <updated>2026-03-06T06:07:54.284Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="算法笔记" scheme="https://blog.weilanx.com/categories/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0/"/>
    <category term="Java" scheme="https://blog.weilanx.com/tags/Java/"/>
    <category term="动态规划" scheme="https://blog.weilanx.com/tags/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/"/>
    <category term="股票买卖" scheme="https://blog.weilanx.com/tags/%E8%82%A1%E7%A5%A8%E4%B9%B0%E5%8D%96/"/>
    <id>https://blog.weilanx.com/posts/gJHa/</id>
    <link href="https://blog.weilanx.com/posts/gJHa/"/>
    <published>2026-03-06T05:23:39.194Z</published>
    <summary>
      <![CDATA[<p>哈喽，大家好呀，我是蔚蓝🥰，今天我们要进行一场彻底的「买卖股票」大通关！</p>
<p>之前有很多小伙伴跟我说，股票题一道道刷起来太痛苦了。其实，如果你能看透这背后的「状态机」本质，无论题目怎么变——是限制次数、带冷冻期，还是收手续费，甚至允许「做空」，它们在你的眼里都只]]>
    </summary>
    <title>买卖股票系列：从状态机彻底吃透动态规划</title>
    <updated>2026-03-06T05:28:21.155Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="MySQL" scheme="https://blog.weilanx.com/categories/MySQL/"/>
    <category term="数据库" scheme="https://blog.weilanx.com/tags/%E6%95%B0%E6%8D%AE%E5%BA%93/"/>
    <category term="索引" scheme="https://blog.weilanx.com/tags/%E7%B4%A2%E5%BC%95/"/>
    <category term="面试指南" scheme="https://blog.weilanx.com/tags/%E9%9D%A2%E8%AF%95%E6%8C%87%E5%8D%97/"/>
    <id>https://blog.weilanx.com/posts/Xtbx/</id>
    <link href="https://blog.weilanx.com/posts/Xtbx/"/>
    <published>2026-03-05T15:14:59.489Z</published>
    <summary>
      <![CDATA[<h2 id="⚡-索引核心知识点全景"><a href="#⚡-索引核心知识点全景" class="headerlink" title="⚡ 索引核心知识点全景"></a>⚡ 索引核心知识点全景</h2><p>在深入具体面试题之前，我们先通过以下几个维度梳理 MySQL 索引的]]>
    </summary>
    <title>MySQL 索引：从 B+ 树底层原理到大厂高频考点全解析</title>
    <updated>2026-03-05T15:14:59.489Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="设计模式" scheme="https://blog.weilanx.com/categories/%E8%AE%BE%E8%AE%A1%E6%A8%A1%E5%BC%8F/"/>
    <category term="Java" scheme="https://blog.weilanx.com/tags/Java/"/>
    <category term="模板方法模式" scheme="https://blog.weilanx.com/tags/%E6%A8%A1%E6%9D%BF%E6%96%B9%E6%B3%95%E6%A8%A1%E5%BC%8F/"/>
    <category term="代码复用" scheme="https://blog.weilanx.com/tags/%E4%BB%A3%E7%A0%81%E5%A4%8D%E7%94%A8/"/>
    <category term="行为模式" scheme="https://blog.weilanx.com/tags/%E8%A1%8C%E4%B8%BA%E6%A8%A1%E5%BC%8F/"/>
    <id>https://blog.weilanx.com/posts/MrnO/</id>
    <link href="https://blog.weilanx.com/posts/MrnO/"/>
    <published>2026-03-05T11:41:07.052Z</published>
    <summary>
      <![CDATA[<h1 id="别再复制粘贴了：用「模板方法模式」封装你的算法骨架"><a href="#别再复制粘贴了：用「模板方法模式」封装你的算法骨架" class="headerlink" title="别再复制粘贴了：用「模板方法模式」封装你的算法骨架"></a>别再复制粘贴了：用「模]]>
    </summary>
    <title>别再复制粘贴了：用「模板方法模式」封装你的算法骨架</title>
    <updated>2026-03-05T11:41:07.052Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="算法笔记" scheme="https://blog.weilanx.com/categories/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0/"/>
    <category term="Java" scheme="https://blog.weilanx.com/tags/Java/"/>
    <category term="算法" scheme="https://blog.weilanx.com/tags/%E7%AE%97%E6%B3%95/"/>
    <category term="动态规划" scheme="https://blog.weilanx.com/tags/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/"/>
    <category term="背包问题" scheme="https://blog.weilanx.com/tags/%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98/"/>
    <id>https://blog.weilanx.com/posts/j8wE/</id>
    <link href="https://blog.weilanx.com/posts/j8wE/"/>
    <published>2026-03-05T06:35:31.042Z</published>
    <summary>
      <![CDATA[<h1 id="背包问题：别死背模板了，看看这层「剩余空间」的逻辑"><a href="#背包问题：别死背模板了，看看这层「剩余空间」的逻辑" class="headerlink" title="背包问题：别死背模板了，看看这层「剩余空间」的逻辑"></a>背包问题：别死背模板了]]>
    </summary>
    <title>背包问题：别死背模板了，看看这层「剩余空间」的逻辑</title>
    <updated>2026-03-05T06:35:31.042Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="部署运维" scheme="https://blog.weilanx.com/categories/%E9%83%A8%E7%BD%B2%E8%BF%90%E7%BB%B4/"/>
    <category term="部署上线" scheme="https://blog.weilanx.com/tags/%E9%83%A8%E7%BD%B2%E4%B8%8A%E7%BA%BF/"/>
    <category term="云服务" scheme="https://blog.weilanx.com/tags/%E4%BA%91%E6%9C%8D%E5%8A%A1/"/>
    <category term="Java" scheme="https://blog.weilanx.com/tags/Java/"/>
    <category term="Docker" scheme="https://blog.weilanx.com/tags/Docker/"/>
    <category term="自动化脚本" scheme="https://blog.weilanx.com/tags/%E8%87%AA%E5%8A%A8%E5%8C%96%E8%84%9A%E6%9C%AC/"/>
    <id>https://blog.weilanx.com/posts/ifDZ/</id>
    <link href="https://blog.weilanx.com/posts/ifDZ/"/>
    <published>2026-03-04T11:35:03.988Z</published>
    <summary>
      <![CDATA[<h1 id="EduSpark-上云实战复盘：从本地构建到服务器部署，把所有坑踩成文档"><a href="#EduSpark-上云实战复盘：从本地构建到服务器部署，把所有坑踩成文档" class="headerlink" title="EduSpark 上云实战复盘：从本地构]]>
    </summary>
    <title>EduSpark 上云实战复盘：从本地构建到服务器部署，把所有坑踩成文档</title>
    <updated>2026-03-04T11:35:03.988Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="算法笔记" scheme="https://blog.weilanx.com/categories/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0/"/>
    <category term="Java" scheme="https://blog.weilanx.com/tags/Java/"/>
    <category term="算法" scheme="https://blog.weilanx.com/tags/%E7%AE%97%E6%B3%95/"/>
    <category term="二分算法" scheme="https://blog.weilanx.com/tags/%E4%BA%8C%E5%88%86%E7%AE%97%E6%B3%95/"/>
    <category term="二分答案" scheme="https://blog.weilanx.com/tags/%E4%BA%8C%E5%88%86%E7%AD%94%E6%A1%88/"/>
    <id>https://blog.weilanx.com/posts/P9N3/</id>
    <link href="https://blog.weilanx.com/posts/P9N3/"/>
    <published>2026-03-04T07:05:20.558Z</published>
    <summary>
      <![CDATA[<h1 id="二分算法全攻略：从查找数值到二分答案的质变"><a href="#二分算法全攻略：从查找数值到二分答案的质变" class="headerlink" title="二分算法全攻略：从查找数值到二分答案的质变"></a>二分算法全攻略：从查找数值到二分答案的质变</]]>
    </summary>
    <title>二分算法全攻略：从查找数值到二分答案的质变</title>
    <updated>2026-03-04T07:05:20.558Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="算法笔记" scheme="https://blog.weilanx.com/categories/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0/"/>
    <category term="算法" scheme="https://blog.weilanx.com/tags/%E7%AE%97%E6%B3%95/"/>
    <category term="单调栈" scheme="https://blog.weilanx.com/tags/%E5%8D%95%E8%B0%83%E6%A0%88/"/>
    <category term="考研机试" scheme="https://blog.weilanx.com/tags/%E8%80%83%E7%A0%94%E6%9C%BA%E8%AF%95/"/>
    <category term="接雨水" scheme="https://blog.weilanx.com/tags/%E6%8E%A5%E9%9B%A8%E6%B0%B4/"/>
    <id>https://blog.weilanx.com/posts/pHky/</id>
    <link href="https://blog.weilanx.com/posts/pHky/"/>
    <published>2026-03-04T06:28:05.736Z</published>
    <summary>
      <![CDATA[<h1 id="单调栈算法全攻略：从基础模板到机试高阶应用"><a href="#单调栈算法全攻略：从基础模板到机试高阶应用" class="headerlink" title="单调栈算法全攻略：从基础模板到机试高阶应用"></a>单调栈算法全攻略：从基础模板到机试高阶应用</]]>
    </summary>
    <title>单调栈算法全攻略：从基础模板到机试高阶应用</title>
    <updated>2026-03-04T06:28:05.736Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="实习校招" scheme="https://blog.weilanx.com/categories/%E5%AE%9E%E4%B9%A0%E6%A0%A1%E6%8B%9B/"/>
    <category term="面经" scheme="https://blog.weilanx.com/tags/%E9%9D%A2%E7%BB%8F/"/>
    <category term="实习" scheme="https://blog.weilanx.com/tags/%E5%AE%9E%E4%B9%A0/"/>
    <id>https://blog.weilanx.com/posts/TC1I/</id>
    <link href="https://blog.weilanx.com/posts/TC1I/"/>
    <published>2026-03-03T08:14:14.681Z</published>
    <summary>
      <![CDATA[<p>岗位：Web 全栈开发（前端 Vue+后端 Node） base：杭州</p>
<p>时间：2024.11.22</p>
<p>公司核心业务：智慧党建以及红色研学平台服务的系统、小程序等开发</p>
<p>哈喽各位小伙伴，我来回馈编程导航了。第一次写面经，还是我的处女面【手]]>
    </summary>
    <title>杭州智瀑科技实习面经</title>
    <updated>2026-03-03T08:14:14.681Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="实习校招" scheme="https://blog.weilanx.com/categories/%E5%AE%9E%E4%B9%A0%E6%A0%A1%E6%8B%9B/"/>
    <category term="Java" scheme="https://blog.weilanx.com/tags/Java/"/>
    <category term="面经" scheme="https://blog.weilanx.com/tags/%E9%9D%A2%E7%BB%8F/"/>
    <category term="实习" scheme="https://blog.weilanx.com/tags/%E5%AE%9E%E4%B9%A0/"/>
    <id>https://blog.weilanx.com/posts/Abs0/</id>
    <link href="https://blog.weilanx.com/posts/Abs0/"/>
    <published>2026-03-03T06:35:12.665Z</published>
    <summary>
      <![CDATA[<p><strong>岗位</strong>：Java 后端（终于到 Java 了，家人们） base：杭州</p>
<p><strong>时间</strong>：2024.11.24</p>
<p><strong>实习薪资</strong>：5k</p>
<p><strong>]]>
    </summary>
    <title>杭州网新恒天实习面经</title>
    <updated>2026-03-03T08:20:42.393Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <id>https://blog.weilanx.com/posts/6qg5/</id>
    <link href="https://blog.weilanx.com/posts/6qg5/"/>
    <published>2026-02-24T14:38:11.187Z</published>
    <summary>
      <![CDATA[<h2 id="在这里开始你的创作…"><a href="#在这里开始你的创作…" class="headerlink" title="在这里开始你的创作…"></a>在这里开始你的创作…</h2>]]>
    </summary>
    <title>Claude Code 绘制 PPT</title>
    <updated>2026-02-24T14:49:25.962Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="AnHeYu博客框架搭建" scheme="https://blog.weilanx.com/categories/AnHeYu%E5%8D%9A%E5%AE%A2%E6%A1%86%E6%9E%B6%E6%90%AD%E5%BB%BA/"/>
    <category term="部署上线" scheme="https://blog.weilanx.com/tags/%E9%83%A8%E7%BD%B2%E4%B8%8A%E7%BA%BF/"/>
    <category term="云服务" scheme="https://blog.weilanx.com/tags/%E4%BA%91%E6%9C%8D%E5%8A%A1/"/>
    <category term="博客搭建" scheme="https://blog.weilanx.com/tags/%E5%8D%9A%E5%AE%A2%E6%90%AD%E5%BB%BA/"/>
    <id>https://blog.weilanx.com/posts/BUj2/</id>
    <link href="https://blog.weilanx.com/posts/BUj2/"/>
    <published>2025-12-28T08:08:35.254Z</published>
    <summary>
      <![CDATA[<h1 id="马不停蹄写稿中。。。"><a href="#马不停蹄写稿中。。。" class="headerlink" title="马不停蹄写稿中。。。"></a>马不停蹄写稿中。。。</h1>]]>
    </summary>
    <title>第三期：AnHeYu存储方案与EdgeOne网站加速</title>
    <updated>2025-12-28T08:15:07.891Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="AnHeYu博客框架搭建" scheme="https://blog.weilanx.com/categories/AnHeYu%E5%8D%9A%E5%AE%A2%E6%A1%86%E6%9E%B6%E6%90%AD%E5%BB%BA/"/>
    <category term="部署上线" scheme="https://blog.weilanx.com/tags/%E9%83%A8%E7%BD%B2%E4%B8%8A%E7%BA%BF/"/>
    <category term="云服务" scheme="https://blog.weilanx.com/tags/%E4%BA%91%E6%9C%8D%E5%8A%A1/"/>
    <category term="博客搭建" scheme="https://blog.weilanx.com/tags/%E5%8D%9A%E5%AE%A2%E6%90%AD%E5%BB%BA/"/>
    <id>https://blog.weilanx.com/posts/n1qu/</id>
    <link href="https://blog.weilanx.com/posts/n1qu/"/>
    <published>2025-12-28T08:05:15.228Z</published>
    <summary>
      <![CDATA[<h1 id="马不停蹄写稿中。。。"><a href="#马不停蹄写稿中。。。" class="headerlink" title="马不停蹄写稿中。。。"></a>马不停蹄写稿中。。。</h1>]]>
    </summary>
    <title>第二期：域名购买、备案并绑定到服务器</title>
    <updated>2025-12-28T08:14:24.583Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <category term="AnHeYu博客框架搭建" scheme="https://blog.weilanx.com/categories/AnHeYu%E5%8D%9A%E5%AE%A2%E6%A1%86%E6%9E%B6%E6%90%AD%E5%BB%BA/"/>
    <category term="部署上线" scheme="https://blog.weilanx.com/tags/%E9%83%A8%E7%BD%B2%E4%B8%8A%E7%BA%BF/"/>
    <category term="云服务" scheme="https://blog.weilanx.com/tags/%E4%BA%91%E6%9C%8D%E5%8A%A1/"/>
    <category term="博客搭建" scheme="https://blog.weilanx.com/tags/%E5%8D%9A%E5%AE%A2%E6%90%AD%E5%BB%BA/"/>
    <id>https://blog.weilanx.com/posts/fL9r/</id>
    <link href="https://blog.weilanx.com/posts/fL9r/"/>
    <published>2025-12-28T02:11:53.537Z</published>
    <summary>
      <![CDATA[<h1 id="碎碎念🧩"><a href="#碎碎念🧩" class="headerlink" title="碎碎念🧩"></a>碎碎念🧩</h1><p>哈喽，大家好，我是蔚蓝👋🏻
为了更好的维护和发展AnHeYu的生态，让更多的小伙伴都能感受到自己搭建博客的乐趣，]]>
    </summary>
    <title>第一期：服务器搭建部署AnHeYu博客框架</title>
    <updated>2025-12-28T08:13:47.842Z</updated>
  </entry>
  <entry>
    <author>
      <name>蔚蓝WEILANX</name>
    </author>
    <id>https://blog.weilanx.com/posts/5sQj/</id>
    <link href="https://blog.weilanx.com/posts/5sQj/"/>
    <published>2025-12-26T01:24:50.626Z</published>
    <summary>这是一篇系统生成的默认文章</summary>
    <title>欢迎使用 Anheyu-App！</title>
    <updated>2025-12-26T05:24:51.944Z</updated>
  </entry>
</feed>
