<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Jeanes Blog</title><description>技术分享 · 前端开发 · 创意生活</description><link>https://devaus95.github.io/</link><item><title>爬楼梯</title><link>https://devaus95.github.io/practice/climbing-stairs/</link><guid isPermaLink="true">https://devaus95.github.io/practice/climbing-stairs/</guid><description>假设你正在爬楼梯，每次可以爬 1 或 2 个台阶，求爬到第 n 阶有多少种不同的方法。</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>零钱兑换</title><link>https://devaus95.github.io/practice/coin-change/</link><guid isPermaLink="true">https://devaus95.github.io/practice/coin-change/</guid><description>给定不同面额的硬币和一个总金额，计算可以凑成总金额所需的最少硬币个数，每种硬币数量无限。</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>魔理沙的魔导书挑战</title><link>https://devaus95.github.io/practice/marisas-grimoire/</link><guid isPermaLink="true">https://devaus95.github.io/practice/marisas-grimoire/</guid><description>按顺序挑战魔导书，每本书消耗或增加魔力值，求在魔力值始终非负的前提下最多能挑战多少本</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>最少转向次数</title><link>https://devaus95.github.io/practice/min-turn-count/</link><guid isPermaLink="true">https://devaus95.github.io/practice/min-turn-count/</guid><description>在网格中只向右或向下移动，仅经过值为0的格点，求从左上到右下的最少转向次数</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>采购方案（背包计数）</title><link>https://devaus95.github.io/practice/purchase-plan/</link><guid isPermaLink="true">https://devaus95.github.io/practice/purchase-plan/</guid><description>每种素材至少买一个，恰好花完预算，求采购方案总数（完全背包计数）</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>不同路径</title><link>https://devaus95.github.io/practice/unique-paths/</link><guid isPermaLink="true">https://devaus95.github.io/practice/unique-paths/</guid><description>计算从左上角到右下角的不同路径数量，机器人只能向下或向右移动。</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>全排列</title><link>https://devaus95.github.io/practice/permutations/</link><guid isPermaLink="true">https://devaus95.github.io/practice/permutations/</guid><description>给定一个不含重复数字的数组，返回其所有可能的全排列。</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>两数之和 II - 输入有序数组</title><link>https://devaus95.github.io/practice/two-sum-ii/</link><guid isPermaLink="true">https://devaus95.github.io/practice/two-sum-ii/</guid><description>给定一个升序数组和一个目标值，找到和为目标值的两个元素下标。</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>最小化两组极差之和</title><link>https://devaus95.github.io/practice/min-range-sum/</link><guid isPermaLink="true">https://devaus95.github.io/practice/min-range-sum/</guid><description>将数组分成两组（均非空），最小化两组的极差之和</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>统计不重叠区间数量</title><link>https://devaus95.github.io/practice/non-overlapping-intervals/</link><guid isPermaLink="true">https://devaus95.github.io/practice/non-overlapping-intervals/</guid><description>给定一组区间，统计与其他任何区间都不重叠的区间数量</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>版本号排序</title><link>https://devaus95.github.io/practice/version-sort/</link><guid isPermaLink="true">https://devaus95.github.io/practice/version-sort/</guid><description>按照自定义规则对版本号字符串进行排序，包括主版本号逐段比较和测试版优先级处理</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>爱丽丝的人偶符法</title><link>https://devaus95.github.io/practice/alice-doll-magic/</link><guid isPermaLink="true">https://devaus95.github.io/practice/alice-doll-magic/</guid><description>在树上选择节点翻转其子树同奇偶深度节点，求从初始状态变为目标状态的最少操作次数</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>课程表</title><link>https://devaus95.github.io/practice/course-schedule/</link><guid isPermaLink="true">https://devaus95.github.io/practice/course-schedule/</guid><description>给定课程依赖关系，判断是否可以完成所有课程。</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>依赖关系检测与版本更新</title><link>https://devaus95.github.io/practice/dependency-detection/</link><guid isPermaLink="true">https://devaus95.github.io/practice/dependency-detection/</guid><description>检测有向图中的循环依赖，若无环则更新每个被依赖部件的最大版本号</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>二叉树的层序遍历</title><link>https://devaus95.github.io/practice/level-order/</link><guid isPermaLink="true">https://devaus95.github.io/practice/level-order/</guid><description>给定二叉树的根节点，返回其节点值的层序遍历结果（逐层从左到右）。</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>魔导传输网络</title><link>https://devaus95.github.io/practice/magic-network/</link><guid isPermaLink="true">https://devaus95.github.io/practice/magic-network/</guid><description>在双向带权图中多次查询两个节点之间的最短路径，使用 Floyd 预处理应对大量查询</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>二叉树的最大深度</title><link>https://devaus95.github.io/practice/max-depth/</link><guid isPermaLink="true">https://devaus95.github.io/practice/max-depth/</guid><description>给定二叉树根节点，返回其最大深度，即从根节点到最远叶子节点的最长路径上的节点数。</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>盘丝洞灵气路径</title><link>https://devaus95.github.io/practice/pan-si-dong-path/</link><guid isPermaLink="true">https://devaus95.github.io/practice/pan-si-dong-path/</guid><description>在二叉树中统计从根到叶子的合法路径，路径上不允许连续两个负值节点，求最大路径和、阈值判断和路径总数</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>二叉树的前序遍历</title><link>https://devaus95.github.io/practice/preorder-traversal/</link><guid isPermaLink="true">https://devaus95.github.io/practice/preorder-traversal/</guid><description>给定二叉树的根节点，返回其节点值的前序遍历结果（根 → 左 → 右）。</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>对称二叉树</title><link>https://devaus95.github.io/practice/symmetric-tree/</link><guid isPermaLink="true">https://devaus95.github.io/practice/symmetric-tree/</guid><description>给定二叉树的根节点，检查它是否是轴对称的。</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>岛屿数量</title><link>https://devaus95.github.io/practice/number-of-islands/</link><guid isPermaLink="true">https://devaus95.github.io/practice/number-of-islands/</guid><description>给定一个由 &apos;1&apos;（陆地）和 &apos;0&apos;（水）组成的二维网格，计算岛屿的数量。</description><pubDate>Sun, 12 Jul 2026 15:43:56 GMT</pubDate></item><item><title>微服务架构实战</title><link>https://devaus95.github.io/columns/microservices/microservices/</link><guid isPermaLink="true">https://devaus95.github.io/columns/microservices/microservices/</guid><description>从单体到微服务的演进，涵盖服务拆分、通信、治理、可观测性等核心问题与解决方案。</description><pubDate>Sun, 12 Jul 2026 00:00:00 GMT</pubDate></item><item><title>API 网关：微服务入口的统一管控</title><link>https://devaus95.github.io/columns/microservices/microservices/01-api-gateway/</link><guid isPermaLink="true">https://devaus95.github.io/columns/microservices/microservices/01-api-gateway/</guid><description>API 网关作为微服务架构的入口层，承担路由、认证、限流、聚合等职责，是服务治理的第一道关卡。</description><pubDate>Sun, 12 Jul 2026 00:00:00 GMT</pubDate></item><item><title>事件驱动架构：用异步解耦微服务</title><link>https://devaus95.github.io/columns/microservices/microservices/02-event-driven/</link><guid isPermaLink="true">https://devaus95.github.io/columns/microservices/microservices/02-event-driven/</guid><description>通过消息队列和事件总线实现微服务间的异步解耦，提升系统弹性与可扩展性。</description><pubDate>Sun, 12 Jul 2026 00:00:00 GMT</pubDate></item><item><title>Markdown Style Guide</title><link>https://devaus95.github.io/blog/markdown-style-guide/</link><guid isPermaLink="true">https://devaus95.github.io/blog/markdown-style-guide/</guid><description>Here is a sample of some basic Markdown syntax that can be used when writing Markdown content in Astro.</description><pubDate>Tue, 18 Jun 2024 16:00:00 GMT</pubDate></item><item><title>Using MDX</title><link>https://devaus95.github.io/blog/using-mdx/</link><guid isPermaLink="true">https://devaus95.github.io/blog/using-mdx/</guid><description>Lorem ipsum dolor sit amet</description><pubDate>Fri, 31 May 2024 16:00:00 GMT</pubDate></item></channel></rss>