The portfolio of Zhou Shouyu.https://shouyu.xyz/https://shouyu.xyz/blog/01knapsacktheory/https://shouyu.xyz/blog/01knapsacktheory/深入理解01背包问题的动态规划解法，包括二维dp数组和一维dp数组的实现。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/01knapsacktheory2/https://shouyu.xyz/blog/01knapsacktheory2/01背包问题的一维dp数组实现，空间优化版本详解。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/a-llm-scratch-01/https://shouyu.xyz/blog/a-llm-scratch-01/位置嵌入、注意力机制、前馈网络等Transformer核心组件的详细解析。Sun, 26 Apr 2026 00:00:00 GMThttps://shouyu.xyz/blog/a-star-algorithm/https://shouyu.xyz/blog/a-star-algorithm/深入理解A*启发式搜索算法，解决骑士最短路径问题。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/advanced-markdown-features/https://shouyu.xyz/blog/advanced-markdown-features/Exploring footnotes, tables, callouts, and more.Wed, 01 Apr 2026 00:00:00 GMThttps://shouyu.xyz/blog/ai-full-stack-best-practice/https://shouyu.xyz/blog/ai-full-stack-best-practice/AI全栈开发的最佳实践指南，涵盖框架选择、组件开发、Supabase使用、Chrome插件开发和支付集成等核心内容。Sat, 25 Apr 2026 00:00:00 GMThttps://shouyu.xyz/blog/all-paths-from-source/https://shouyu.xyz/blog/all-paths-from-source/使用DFS和BFS解决有向无环图中从节点1到节点N的所有路径问题。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/array-theory/https://shouyu.xyz/blog/array-theory/深入理解数组的基本概念、定义、访问方式以及在内存中的表示。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/assign-cookies/https://shouyu.xyz/blog/assign-cookies/贪心算法典型例题：大饼干优先给大胃口的小朋友。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/bellman-ford-algorithm/https://shouyu.xyz/blog/bellman-ford-algorithm/深入理解Bellman-Ford最短路算法，处理负权边问题。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/bellman-ford-negative-cycle-detection/https://shouyu.xyz/blog/bellman-ford-negative-cycle-detection/使用Bellman-Ford算法检测图中是否存在负权回路。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/bellman-ford-single-source-shortest-path-with-limits/https://shouyu.xyz/blog/bellman-ford-single-source-shortest-path-with-limits/使用Bellman-Ford算法解决最多经过K个节点的最短路径问题。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/best-time-to-buy-and-sell-stock/https://shouyu.xyz/blog/best-time-to-buy-and-sell-stock/动态规划和贪心算法解决股票买卖问题，计算最大利润。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/best-time-to-buy-and-sell-stock-ii/https://shouyu.xyz/blog/best-time-to-buy-and-sell-stock-ii/动态规划和贪心算法解决股票买卖问题II，计算最大利润。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/best-time-to-buy-and-sell-stock-ii-2/https://shouyu.xyz/blog/best-time-to-buy-and-sell-stock-ii-2/贪心算法解决股票买卖问题，多次交易获取最大利润。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/best-time-to-buy-and-sell-stock-iii/https://shouyu.xyz/blog/best-time-to-buy-and-sell-stock-iii/动态规划状态机解法，最多完成两笔交易的最大利润。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/best-time-to-buy-and-sell-stock-iv/https://shouyu.xyz/blog/best-time-to-buy-and-sell-stock-iv/动态规划解决最多K笔交易的股票问题。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/best-time-to-buy-and-sell-stock-with-cooldown/https://shouyu.xyz/blog/best-time-to-buy-and-sell-stock-with-cooldown/动态规划解决含冷冻期的股票买卖最大利润问题。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/best-time-to-buy-and-sell-stock-with-fee/https://shouyu.xyz/blog/best-time-to-buy-and-sell-stock-with-fee/动态规划解决含手续费的股票买卖最大利润问题。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/bfs-theory/https://shouyu.xyz/blog/bfs-theory/深入理解BFS广度优先搜索的适用场景、过程和代码框架。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/binary-tree-cameras/https://shouyu.xyz/blog/binary-tree-cameras/贪心算法结合DFS解决监控二叉树问题，计算最小摄像头数量。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/building-largest-artificial-island/https://shouyu.xyz/blog/building-largest-artificial-island/DFS深度优先搜索解决最大人工岛问题，将一格水变为陆地后求最大岛屿面积。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/candy/https://shouyu.xyz/blog/candy/贪心算法解决分发糖果问题，相邻评分高的孩子获得更多糖果。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-array209-minimum-size-subarray/https://shouyu.xyz/blog/carl-array209-minimum-size-subarray/滑动窗口算法解决长度最小的子数组问题，找到满足和大于等于s的最小长度连续子数组。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-array27-remove-element/https://shouyu.xyz/blog/carl-array27-remove-element/原地移除数组中所有等于val的元素，返回不同元素的数量。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-array44-subtract-land/https://shouyu.xyz/blog/carl-array44-subtract-land/使用前缀和技巧解决土地购买问题，将城市区域分成两个子区域使价值差最小。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-array54-range-sum/https://shouyu.xyz/blog/carl-array54-range-sum/使用前缀和技巧快速计算数组指定区间内元素的总和。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-array59-spiral-matrix/https://shouyu.xyz/blog/carl-array59-spiral-matrix/模拟行走法生成螺旋矩阵，按顺时针顺序螺旋排列。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-array704-binary-search/https://shouyu.xyz/blog/carl-array704-binary-search/二分查找算法模板，在有序数组中搜索目标值。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-array997-squares-of-sorted-array/https://shouyu.xyz/blog/carl-array997-squares-of-sorted-array/双指针法解决有序数组的平方问题，非递减顺序排序的整数数组平方后仍按非递减顺序排列。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtracking-deduplication-alternative/https://shouyu.xyz/blog/carl-backtracking-deduplication-alternative/回溯算法中去重的另一种写法，使用set标记本层已选择的元素。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtracking-letter-combinations/https://shouyu.xyz/blog/carl-backtracking-letter-combinations/回溯算法解决电话号码字母组合问题，给定数字字符串返回所有可能的字母组合。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtracking-n-queens/https://shouyu.xyz/blog/carl-backtracking-n-queens/回溯算法解决N皇后问题，在n×n棋盘上放置n个皇后且彼此不能相互攻击。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtracking-reconstruct-itinerary/https://shouyu.xyz/blog/carl-backtracking-reconstruct-itinerary/回溯算法解决重新安排行程问题，对机票列表进行排序。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtracking-restore-ip-addresses/https://shouyu.xyz/blog/carl-backtracking-restore-ip-addresses/回溯算法解决复原IP地址问题，将数字字符串分割成有效的IP地址。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtracking-sudoku-solver/https://shouyu.xyz/blog/carl-backtracking-sudoku-solver/回溯算法解决数独问题，填充空格使数独满足规则。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtracking-summary/https://shouyu.xyz/blog/carl-backtracking-summary/回溯算法理论基础总结，组合问题、排列问题、切割问题的回溯解法。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtracking131-palindrome-partitioning/https://shouyu.xyz/blog/carl-backtracking131-palindrome-partitioning/给你一个字符串 s，请你将 s 分割成一些子串，使每个子串都是回文串。返回 s 所有可能的分割方案。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtracking46-permutation/https://shouyu.xyz/blog/carl-backtracking46-permutation/给定一个不含重复数字的数组 nums，返回其所有可能的全排列。你可以按任意顺序返回答案。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtracking491-increasing-subsequences/https://shouyu.xyz/blog/carl-backtracking491-increasing-subsequences/给你一个整数数组 nums，找出并返回所有该数组中不同的递增子序列，递增子序列中至少有两个元素。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtracking77-combination/https://shouyu.xyz/blog/carl-backtracking77-combination/给定两个整数 n 和 k，返回范围 [1, n] 中所有可能的 k 个数的组合。你可以按任何顺序返回答案。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtracking78-subset/https://shouyu.xyz/blog/carl-backtracking78-subset/给你一个整数数组 nums，数组中的元素互不相同。返回该数组所有可能的子集（幂集）。解集不能包含重复的子集。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtrackingcombination-optimization/https://shouyu.xyz/blog/carl-backtrackingcombination-optimization/给定两个整数 n 和 k，返回范围 [1, n] 中所有可能的 k 个数的组合。优化回溯搜索的剪枝策略。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtrackingcombination-sum/https://shouyu.xyz/blog/carl-backtrackingcombination-sum/给你一个无重复元素的整数数组 candidates 和一个目标整数 target，找出 candidates 中可以使数字和为目标数 target 的所有不同组合。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtrackingcombination-sum-ii/https://shouyu.xyz/blog/carl-backtrackingcombination-sum-ii/给定一个候选人编号的集合 candidates 和一个目标数 target，找出 candidates 中所有可以使数字和为 target 的组合。每个数字在每个组合中只能使用一次。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtrackingcombination-sum-iii/https://shouyu.xyz/blog/carl-backtrackingcombination-sum-iii/找出所有相加之和为 n 的 k 个数的组合，且满足只使用数字 1 到 9，每个数字最多使用一次。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtrackingpermutationii/https://shouyu.xyz/blog/carl-backtrackingpermutationii/给定一个可包含重复数字的序列 nums，按任意顺序返回所有不重复的全排列。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtrackingsubsetii/https://shouyu.xyz/blog/carl-backtrackingsubsetii/给你一个整数数组 nums，其中可能包含重复元素，请你返回该数组所有可能的子集（幂集）。解集不能包含重复的子集。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-backtrackingtheory/https://shouyu.xyz/blog/carl-backtrackingtheory/回溯算法理论基础，包括组合、排列、切割、子集和棋盘等问题类型，以及回溯法模板和递归三部曲。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-all-paths/https://shouyu.xyz/blog/carl-binary-tree-all-paths/给定一个二叉树，返回所有从根节点到叶子节点的路径。说明: 叶子节点是指没有子节点的节点。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-array-to-bst/https://shouyu.xyz/blog/carl-binary-tree-array-to-bst/给你一个整数数组 nums，其中元素已经按升序排列，请你将其转换为一棵平衡二叉搜索树。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-balanced-binary-tree/https://shouyu.xyz/blog/carl-binary-tree-balanced-binary-tree/给定一个二叉树，判断它是否是平衡二叉树。平衡二叉树是树中任意节点左右子树的高度相差不超过1。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-bottom-left-value/https://shouyu.xyz/blog/carl-binary-tree-bottom-left-value/给定一个二叉树的根节点 root，请找出该二叉树的最底层最左边节点的值。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-bst-lowest-common-ancestor/https://shouyu.xyz/blog/carl-binary-tree-bst-lowest-common-ancestor/给定一个二叉搜索树, 找到该树中两个指定节点的最近公共祖先。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-construct-from-inorder-postorder/https://shouyu.xyz/blog/carl-binary-tree-construct-from-inorder-postorder/给定两个整数数组 inorder 和 postorder ，其中 inorder 是二叉树的中序遍历，postorder 是后序遍历，请你构造二叉树。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-convert-bst-to-greater-tree/https://shouyu.xyz/blog/carl-binary-tree-convert-bst-to-greater-tree/给出二叉搜索树的根节点，该树的节点值各不相同，请你将其转换为累加树，使每个节点的新值等于原树中大于或等于该节点的值之和。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-count-complete-nodes/https://shouyu.xyz/blog/carl-binary-tree-count-complete-nodes/给你一棵完全二叉树的根节点 root，求出该树的节点个数。完全二叉树除了最底层节点可能没填满外，其余每层节点数都达到最大值。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-delete-node-in-bst/https://shouyu.xyz/blog/carl-binary-tree-delete-node-in-bst/给定一个二叉搜索树的根节点 root 和一个值 key，删除二叉搜索树中的 key 对应的节点，并保证二叉搜索树的性质不变。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-find-mode-in-bst/https://shouyu.xyz/blog/carl-binary-tree-find-mode-in-bst/给你一个含重复值的二叉搜索树（BST）的根节点 root，找出并返回 BST 中的所有众数（即，出现频率最高的元素）。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-insert-into-bst/https://shouyu.xyz/blog/carl-binary-tree-insert-into-bst/给定一个二叉搜索树和要插入的值，将值插入二叉搜索树。返回插入后的二叉搜索树的根节点。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-iterative-traversal/https://shouyu.xyz/blog/carl-binary-tree-iterative-traversal/使用迭代法实现二叉树的前、中、后序遍历。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-lowest-common-ancestor/https://shouyu.xyz/blog/carl-binary-tree-lowest-common-ancestor/给定一个二叉树, 找到该树中两个指定节点的最近公共祖先。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-maximum-binary-tree/https://shouyu.xyz/blog/carl-binary-tree-maximum-binary-tree/给定一个不重复的整数数组 nums，最大二叉树可以用下面的算法从 nums 递归地构建。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-merge-two-binary-trees/https://shouyu.xyz/blog/carl-binary-tree-merge-two-binary-trees/给你两棵二叉树：root1 和 root2。想象一下，当你将其中一棵覆盖到另一棵之上时，两棵树上的一些节点将会重叠。合并这两棵树为一棵新二叉树。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-minimum-absolute-difference-in-bst/https://shouyu.xyz/blog/carl-binary-tree-minimum-absolute-difference-in-bst/给你一棵所有节点为非负值的二叉搜索树，请你计算树中任意两节点的差的绝对值的最小值。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-path-sum/https://shouyu.xyz/blog/carl-binary-tree-path-sum/给你二叉树的根节点 root 和一个表示目标和的整数 targetSum，判断该树中是否存在根节点到叶子节点的路径，这条路径上所有节点值相加等于目标和。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-recursive-traversal/https://shouyu.xyz/blog/carl-binary-tree-recursive-traversal/使用递归法实现二叉树的前序、中序、后序遍历。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-sum-of-left-leaves/https://shouyu.xyz/blog/carl-binary-tree-sum-of-left-leaves/给定二叉树的根节点 root，返回所有左叶子之和。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-summary/https://shouyu.xyz/blog/carl-binary-tree-summary/二叉树知识点总结，包括理论基础、遍历方式、属性、修改构造和公共祖先问题。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-theory/https://shouyu.xyz/blog/carl-binary-tree-theory/二叉树理论基础，包括二叉树的种类、存储方式和遍历方式。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree-unified-iterative/https://shouyu.xyz/blog/carl-binary-tree-unified-iterative/统一迭代法实现二叉树的前、中、后序遍历。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree101-symmetric-binary-tree/https://shouyu.xyz/blog/carl-binary-tree101-symmetric-binary-tree/给你一个二叉树的根节点 root，检查它是否轴对称。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree102-level-order-traversal/https://shouyu.xyz/blog/carl-binary-tree102-level-order-traversal/给你二叉树的根节点 root ，返回其节点值的层序遍历（即逐层地，从左到右访问所有节点）。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree104-maximum-depth/https://shouyu.xyz/blog/carl-binary-tree104-maximum-depth/给定一个二叉树root，返回其最大深度。二叉树的最大深度是指从根节点到最远叶子节点的最长路径上的节点数。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree111-minimum-depth/https://shouyu.xyz/blog/carl-binary-tree111-minimum-depth/给定一个二叉树，找出其最小深度。最小深度是从根节点到最近叶子节点的最短路径上的节点数量。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree226-invert-binary-tree/https://shouyu.xyz/blog/carl-binary-tree226-invert-binary-tree/给你一棵二叉树的根节点root，翻转这棵二叉树，并返回其根节点。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree669-trim-bst/https://shouyu.xyz/blog/carl-binary-tree669-trim-bst/给你二叉搜索树的根节点root，同时给定最小边界low和最大边界high。通过修剪二叉搜索树，使得所有节点的值在[low, high]中。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree700-search-in-bst/https://shouyu.xyz/blog/carl-binary-tree700-search-in-bst/给定二叉搜索树（BST）的根节点root和一个整数值val，你需要在BST中找到节点值等于val的节点，返回以该节点为根的子树。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-binary-tree98-validate-bst/https://shouyu.xyz/blog/carl-binary-tree98-validate-bst/给你一个二叉树的根节点root，判断其是否是一个有效的二叉搜索树。有效二叉搜索树定义：节点的左子树只包含小于当前节点的数，节点的右子树只包含大于当前节点的数。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-hash-table-1-two-sum/https://shouyu.xyz/blog/carl-hash-table-1-two-sum/给定一个整数数组nums和一个目标值target，请你在该数组中找出和为目标值的两个整数，并返回他们的数组下标。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-hash-table-15-three-sum/https://shouyu.xyz/blog/carl-hash-table-15-three-sum/给定一个整数数组nums，判断是否存在三元组满足i != j、i != k且j != k，同时满足nums[i] + nums[j] + nums[k] == 0。返回所有和为0且不重复的三元组。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-hash-table-202-happy-number/https://shouyu.xyz/blog/carl-hash-table-202-happy-number/编写一个算法来判断一个数n是不是快乐数。快乐数定义为：对于一个正整数，每一次将该数替换为它每个位置上的数字的平方和，然后重复这个过程直到这个数变为1。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-hash-table-242-valid-anagram/https://shouyu.xyz/blog/carl-hash-table-242-valid-anagram/给定两个字符串s和t，编写一个函数来判断t是否是s的字母异位词。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-hash-table-349-intersection-of-two-arrays/https://shouyu.xyz/blog/carl-hash-table-349-intersection-of-two-arrays/给定两个数组nums1和nums2，返回它们的交集。输出结果中的每个元素一定是唯一的。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-hash-table-383-ransom-note/https://shouyu.xyz/blog/carl-hash-table-383-ransom-note/给你两个字符串ransomNote和magazine，判断ransomNote能不能由magazine里面的字符构成。如果可以，返回true；否则返回false。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-hash-table-454-four-sum-ii/https://shouyu.xyz/blog/carl-hash-table-454-four-sum-ii/给定四个整数数组nums1、nums2、nums3和nums4，计算有多少个元组(i, j, k, l)能满足0 <= i, j, k, l < n且nums1[i] + nums2[j] + nums3[k] + nums4[l] == 0。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-linkedlist140-linked-list-cycle/https://shouyu.xyz/blog/carl-linkedlist140-linked-list-cycle/给定一个链表，返回链表开始入环的第一个节点。如果链表无环，则返回null。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-linkedlist160-intersection-of-two-linked-lists/https://shouyu.xyz/blog/carl-linkedlist160-intersection-of-two-linked-lists/给你两个单链表的头节点headA和headB，找出并返回两个单链表相交的起始节点。如果两个链表没有交点，返回null。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-linkedlist19-remove-nth-node/https://shouyu.xyz/blog/carl-linkedlist19-remove-nth-node/给你一个链表，删除链表的倒数第n个结点，并且返回链表的头结点。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-linkedlist203-remove-linked-list-elements/https://shouyu.xyz/blog/carl-linkedlist203-remove-linked-list-elements/删除链表中等于给定值val的所有节点。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-linkedlist206-reverse-linkedlist/https://shouyu.xyz/blog/carl-linkedlist206-reverse-linkedlist/反转一个单链表。示例：输入1->2->3->4->5->NULL，输出5->4->3->2->1->NULL。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-linkedlist24-swap-nodes-in-pairs/https://shouyu.xyz/blog/carl-linkedlist24-swap-nodes-in-pairs/给你一个链表，两两交换其中相邻的节点，并返回交换后链表的头节点。必须在不修改节点内部的值的情况下完成本题。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-linkedlist707-design-linkedlist/https://shouyu.xyz/blog/carl-linkedlist707-design-linkedlist/设计一个链表类，包含初始化对象、获取链表中下标为index的节点的值、在链表第一个元素之前插入一个值为val的节点、追加一个值为val的节点到链表末尾、插入一个值为val的节点到链表下标为index的节点之前、删除下标为index的节点等操作。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-stack-queue-evaluate-reverse-polish-notation/https://shouyu.xyz/blog/carl-stack-queue-evaluate-reverse-polish-notation/给你一个字符串数组tokens，表示一个根据逆波兰表示法表示的算术表达式。计算该表达式并返回表示表达式值的整数。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-stack-queue-implement-stack-using-queues/https://shouyu.xyz/blog/carl-stack-queue-implement-stack-using-queues/请你仅使用两个队列实现一个后入先出（LIFO）的栈，并支持普通栈的全部四种操作（push、top、pop和empty）。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-stack-queue-remove-all-adjacent-duplicates/https://shouyu.xyz/blog/carl-stack-queue-remove-all-adjacent-duplicates/给出由小写字母组成的字符串s，重复项删除操作会选择两个相邻且相同的字母，并删除它们。在反复执行重复项删除操作后返回最终的字符串。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-stack-queue-simplify-path/https://shouyu.xyz/blog/carl-stack-queue-simplify-path/给你一个字符串path，表示指向某一文件或目录的Unix风格绝对路径，将其转化为更加简洁的规范路径。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-stack-queue-sliding-window-maximum/https://shouyu.xyz/blog/carl-stack-queue-sliding-window-maximum/给你一个整数数组nums，有一个大小为k的滑动窗口从数组的最左侧移动到数组的最右侧。返回滑动窗口中的最大值。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-stack-queue-summary/https://shouyu.xyz/blog/carl-stack-queue-summary/栈与队列理论基础的总结，包含栈与队列的特性、STL实现、面试题等内容。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-stack-queue-theory/https://shouyu.xyz/blog/carl-stack-queue-theory/栈与队列的理论基础，包含栈与队列的特性、STL实现、面试题等内容。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-stack-queue-top-k-frequent-elements/https://shouyu.xyz/blog/carl-stack-queue-top-k-frequent-elements/给定一个非空的整数数组，返回其中出现频率前 k 高的元素。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-stack-queue20-valid-parentheses/https://shouyu.xyz/blog/carl-stack-queue20-valid-parentheses/给定一个只包括(、)、{、}、[、]的字符串，判断字符串是否有效。有效字符串需满足：左括号必须用相同类型的右括号闭合，左括号必须以正确的顺序闭合。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-stack-queue232-implement-queue-using-stacks/https://shouyu.xyz/blog/carl-stack-queue232-implement-queue-using-stacks/请你仅使用两个栈实现先入先出队列。队列应当支持一般队列支持的所有操作（push、pop、peek、empty）。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-string-344-reverse-string/https://shouyu.xyz/blog/carl-string-344-reverse-string/编写一个函数，将输入的字符串反转过来。输入字符串以字符数组char[]的形式给出。不要给另外的数组分配额外的空间，必须原地修改输入数组。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-string-541-reverse-string-ii/https://shouyu.xyz/blog/carl-string-541-reverse-string-ii/给定一个字符串s和一个整数k，从字符串开头算起，每计数至2k个字符，就反转这2k个字符中的前k个字符。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-string-implement-strstr/https://shouyu.xyz/blog/carl-string-implement-strstr/给你两个字符串haystack和needle，在haystack字符串中找出needle字符串的第一个匹配项的下标。如果needle不是haystack的一部分，则返回-1。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-string-repeated-substring/https://shouyu.xyz/blog/carl-string-repeated-substring/给定一个非空的字符串s，检查是否可以通过由它的一个子串重复多次构成。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/carl-string-replace-digits/https://shouyu.xyz/blog/carl-string-replace-digits/给定一个字符串s，它包含小写字母和数字字符，将字符串中的字母字符保持不变，而将每个数字字符替换为number。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/china-mobile-game-overseas-market-report-in-china/https://shouyu.xyz/blog/china-mobile-game-overseas-market-report-in-china/本报告分析了2023年中国移动游戏出海市场的现状和发展趋势，包括美、日、韩等地区洞察及重点企业分析Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/climbing-stairs/https://shouyu.xyz/blog/climbing-stairs/经典动态规划问题，分析爬楼梯的不同方法数，包括回溯、记忆化搜索和动态规划解法Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/climbing-stairs-complete-knapsack-version/https://shouyu.xyz/blog/climbing-stairs-complete-knapsack-version/将爬楼梯问题转化为完全背包问题，分析如何计算爬到楼顶的不同方法数Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/coin-change/https://shouyu.xyz/blog/coin-change/计算凑成总金额所需的最少硬币个数，完全背包问题的应用Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/coin-change-ii/https://shouyu.xyz/blog/coin-change-ii/完全背包问题变形，计算凑成总金额的硬币组合数Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/combination-sum-iv/https://shouyu.xyz/blog/combination-sum-iv/完全背包求排列数的问题，计算目标和为target的元素组合个数Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/complete-knapsack-theory/https://shouyu.xyz/blog/complete-knapsack-theory/完全背包问题理论讲解，与01背包的区别在于每种物品有无限个Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/delete-operations-for-two-strings/https://shouyu.xyz/blog/delete-operations-for-two-strings/给定两个单词，计算使它们相同所需的最少删除操作次数Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/dfs-theory/https://shouyu.xyz/blog/dfs-theory/深度优先搜索(DFS)理论基础，包括搜索过程和代码框架Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/dijkstra-naive/https://shouyu.xyz/blog/dijkstra-naive/Dijkstra朴素版算法讲解，在有权图中求从起点到其他节点的最短路径Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/dijkstra-optimized-with-heap/https://shouyu.xyz/blog/dijkstra-optimized-with-heap/使用小顶堆和邻接表优化Dijkstra算法，降低时间复杂度Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/directed-graph-reachability/https://shouyu.xyz/blog/directed-graph-reachability/判断有向图中从节点1能否到达所有其他节点，使用DFS解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/distinct-subsequences/https://shouyu.xyz/blog/distinct-subsequences/统计在字符串s的子序列中t出现的个数Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/docker-quick-practice/https://shouyu.xyz/blog/docker-quick-practice/Docker容器化技术快速入门，包括安装、核心命令、网络模式和Docker ComposeSun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/dynamic-og-image-generation/https://shouyu.xyz/blog/dynamic-og-image-generation/An overview of generating dynamic Open Graph images in Astro.Thu, 02 Apr 2026 00:00:00 GMThttps://shouyu.xyz/blog/dynamic-programming-summary/https://shouyu.xyz/blog/dynamic-programming-summary/动态规划算法总结，包括五部曲和基础问题分类Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/dynamic-programming-theory/https://shouyu.xyz/blog/dynamic-programming-theory/动态规划理论基础，介绍动态规划的直观理解和五步曲解题法Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/edit-distance/https://shouyu.xyz/blog/edit-distance/计算将word1转换成word2所需的最少操作数，包括插入、删除和替换操作Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/edit-distance-summary/https://shouyu.xyz/blog/edit-distance-summary/编辑距离相关问题总结，包括判断子序列和不同的子序列Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/fastapi/https://shouyu.xyz/blog/fastapi/FastAPI最佳实践，一个用于构建API的现代、快速web框架Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/fibonacci-number/https://shouyu.xyz/blog/fibonacci-number/经典斐波那契数列问题，计算F(n)的值Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/find-if-path-exists/https://shouyu.xyz/blog/find-if-path-exists/判断无向图中从source到destination是否存在路径，使用并查集解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/floyd-warshall-algorithm/https://shouyu.xyz/blog/floyd-warshall-algorithm/Floyd-Warshall算法求解多源最短路径问题Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/four-sum/https://shouyu.xyz/blog/four-sum/在数组中找出满足条件的不重复四元组Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/gas-station/https://shouyu.xyz/blog/gas-station/在一条环路上找到能跑完一圈的起始加油站位置Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/graph-theory-summary/https://shouyu.xyz/blog/graph-theory-summary/图论知识点总结，包括深搜与广搜、并查集等Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/graph-theory-theory/https://shouyu.xyz/blog/graph-theory-theory/图论基础概念讲解，包括图的种类、度和存储方式Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/greedy-summary/https://shouyu.xyz/blog/greedy-summary/贪心算法知识点总结，包括理论基础和简单题分类Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/greedy-theory/https://shouyu.xyz/blog/greedy-theory/贪心算法基础理论，局部最优解与全局最优解的关系Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/house-robber/https://shouyu.xyz/blog/house-robber/线性DP问题，计算不触动警报情况下能偷窃到的最高金额Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/house-robber-ii/https://shouyu.xyz/blog/house-robber-ii/环形房屋的偷窃问题，相邻房屋不能同时偷窃Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/house-robber-iii/https://shouyu.xyz/blog/house-robber-iii/二叉树形状的房屋偷窃问题，使用树形DP解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/how-to-configure-astroscholar-theme/https://shouyu.xyz/blog/how-to-configure-astroscholar-theme/A comprehensive guide on configuring the AstroScholar theme.Fri, 03 Apr 2026 00:00:00 GMThttps://shouyu.xyz/blog/integer-break/https://shouyu.xyz/blog/integer-break/将正整数n拆分为k个正整数之和，求最大乘积Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/invert-binary-tree/https://shouyu.xyz/blog/invert-binary-tree/反转字符串中单词的顺序Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/is-subsequence/https://shouyu.xyz/blog/is-subsequence/判断字符串s是否为t的子序列Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/island-area/https://shouyu.xyz/blog/island-area/所有孤岛的总面积Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/island-perimeter/https://shouyu.xyz/blog/island-perimeter/岛屿的周长Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/js-reverse-bidding-search-engine/https://shouyu.xyz/blog/js-reverse-bidding-search-engine/JS逆向之某招标搜索引擎实战，记录加密参数破解过程Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/js-reverse-engineering-anime-website/https://shouyu.xyz/blog/js-reverse-engineering-anime-website/JS逆向实战，记录某日漫网站的加密参数破解过程Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/js-reverse-engineering-tax-website/https://shouyu.xyz/blog/js-reverse-engineering-tax-website/JS逆向实战，记录某电子税务局的加密参数破解过程Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/js-reverse-engineering-web-crawler-encryption/https://shouyu.xyz/blog/js-reverse-engineering-web-crawler-encryption/JavaScript 逆向入门，爬虫的加密参数破解教程Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/jump-game/https://shouyu.xyz/blog/jump-game/给定一个非负整数数组，你最初位于数组的第一个位置。数组中的每个元素代表你在该位置可以跳跃的最大长度。判断你是否能够到达最后一个位置。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/jump-game-ii/https://shouyu.xyz/blog/jump-game-ii/给定一个非负整数数组，你最初位于数组的第一个位置。你的目标是使用最少的跳跃次数到达数组的最后一个位置。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/knapsack-summary/https://shouyu.xyz/blog/knapsack-summary/背包问题算法总结，包括01背包、完全背包、多重背包等Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/last-stone-weight/https://shouyu.xyz/blog/last-stone-weight/最后一块石头的重量算法题解，使用动态规划解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/latex-support/https://shouyu.xyz/blog/latex-support/Demonstrating the new LaTeX math rendering capabilities using remark-math and rehype-katex.Sat, 04 Apr 2026 00:00:00 GMThttps://shouyu.xyz/blog/lemonade-change/https://shouyu.xyz/blog/lemonade-change/柠檬水找零算法题解，使用贪心算法解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/longest-common-subsequence/https://shouyu.xyz/blog/longest-common-subsequence/最长公共子序列算法题解，使用动态规划解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/longest-continuous-increasing-subsequence/https://shouyu.xyz/blog/longest-continuous-increasing-subsequence/最长连续递增序列算法题解，使用动态规划解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/longest-duplicate-subarray/https://shouyu.xyz/blog/longest-duplicate-subarray/最长重复子数组算法题解，使用动态规划解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/longest-increasing-subsequence/https://shouyu.xyz/blog/longest-increasing-subsequence/最长上升子序列算法题解，使用动态规划解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/longest-palindromic-subsequence/https://shouyu.xyz/blog/longest-palindromic-subsequence/最长回文子序列算法题解，使用动态规划解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/markdown-showcase/https://shouyu.xyz/blog/markdown-showcase/A reference post for the Academic Portfolio blog that demonstrates the markdown features supported by this Astro setup.Sun, 05 Apr 2026 00:00:00 GMThttps://shouyu.xyz/blog/max-area-of-island/https://shouyu.xyz/blog/max-area-of-island/岛屿的最大面积算法题解，使用DFS或BFS解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/maximize-array-after-k-negations/https://shouyu.xyz/blog/maximize-array-after-k-negations/K次取反后最大化数组和算法题解，使用贪心算法解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/maximum-subarray/https://shouyu.xyz/blog/maximum-subarray/给定一个整数数组 nums，找到一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/merge-intervals/https://shouyu.xyz/blog/merge-intervals/合并区间算法题解，使用贪心算法解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/minimum-arrows-to-burst-balloons/https://shouyu.xyz/blog/minimum-arrows-to-burst-balloons/用最少数量的箭引爆气球算法题解，使用贪心算法解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/minimum-cost-climbing-stairs/https://shouyu.xyz/blog/minimum-cost-climbing-stairs/使用最小花费爬楼梯算法题解，使用动态规划解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/minimum-spanning-tree-kruskal/https://shouyu.xyz/blog/minimum-spanning-tree-kruskal/最小生成树Kruskal算法详解，使用并查集实现Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/minimum-spanning-tree-prim/https://shouyu.xyz/blog/minimum-spanning-tree-prim/最小生成树Prim算法详解Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/monotone-increasing-digits/https://shouyu.xyz/blog/monotone-increasing-digits/单调递增的数字算法题解，使用贪心算法解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/multiple-knapsack-theory/https://shouyu.xyz/blog/multiple-knapsack-theory/有N种物品和一个容量为V的背包。第i种物品最多有Mi件可用，每件耗费的空间是Ci，价值是Wi。求解将哪些物品装入背包可使这些物品的耗费的空间总和不超过背包容量，且价值总和最大。Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/national-public-policy-big-data-platform/https://shouyu.xyz/blog/national-public-policy-big-data-platform/全国公共政策大数据平台的JS逆向实战Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/non-overlapping-intervals/https://shouyu.xyz/blog/non-overlapping-intervals/无重叠区间算法题解，使用贪心算法解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/number-of-islands-bfs/https://shouyu.xyz/blog/number-of-islands-bfs/岛屿数量算法题解，使用广度优先搜索(BFS)解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/number-of-islands-dfs/https://shouyu.xyz/blog/number-of-islands-dfs/岛屿数量算法题解，使用深度优先搜索(DFS)解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/ones-and-zeros/https://shouyu.xyz/blog/ones-and-zeros/一和零算法题解，使用多维背包的动态规划解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/optimizing-astro-builds/https://shouyu.xyz/blog/optimizing-astro-builds/Tips and tricks to ensure your Astro site builds quickly and runs blazingly fast.Thu, 09 Apr 2026 00:00:00 GMThttps://shouyu.xyz/blog/palindromic-substrings/https://shouyu.xyz/blog/palindromic-substrings/字符串中回文子串的数目算法题解，使用动态规划或双指针法解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/partition-equal-subset-sum/https://shouyu.xyz/blog/partition-equal-subset-sum/分割等和子集算法题解，使用01背包的动态规划解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/partition-labels/https://shouyu.xyz/blog/partition-labels/划分字母区间算法题解，使用贪心算法解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/perfect-squares/https://shouyu.xyz/blog/perfect-squares/完全平方数算法题解，使用完全背包的动态规划解决Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/publish-npm-to-github-pages/https://shouyu.xyz/blog/publish-npm-to-github-pages/npm 包的发布Tue, 12 Mar 2024 00:00:00 GMThttps://shouyu.xyz/blog/python-fstring-advanced-techniques/https://shouyu.xyz/blog/python-fstring-advanced-techniques/python 的字符串格式化Fri, 21 Nov 2025 00:00:00 GMThttps://shouyu.xyz/blog/queue-reconstruction-by-height/https://shouyu.xyz/blog/queue-reconstruction-by-height/贪心算法根据身高重建队列Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/queue-reconstruction-vector-explanation/https://shouyu.xyz/blog/queue-reconstruction-vector-explanation/贪心算法根据身高重建队列的vector原理讲解Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/redundant-connection/https://shouyu.xyz/blog/redundant-connection/无向图的冗余连接问题Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/redundant-connection-ii/https://shouyu.xyz/blog/redundant-connection-ii/有向图的冗余连接问题Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/rotate-right/https://shouyu.xyz/blog/rotate-right/字符串的右旋转操作Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/setup-wsl2-dev-environment/https://shouyu.xyz/blog/setup-wsl2-dev-environment/详细介绍如何在 Windows 系统上配置 WSL2 开发环境，包括基础设置、开发工具安装和 GUI 应用配置。Thu, 21 Mar 2024 00:00:00 GMThttps://shouyu.xyz/blog/shortest-path-problems-summary/https://shouyu.xyz/blog/shortest-path-problems-summary/最短路问题总结：Dijkstra、Bellman_ford、SPFA 和 FloydSun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/spfa-algorithm/https://shouyu.xyz/blog/spfa-algorithm/SPFA算法：队列优化的Bellman-Ford算法，用于最短路问题Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/stock-problems-summary/https://shouyu.xyz/blog/stock-problems-summary/股票问题总结：状态机动态规划Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/string-chain/https://shouyu.xyz/blog/string-chain/字符串接龙问题：广度优先搜索Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/submerged-island/https://shouyu.xyz/blog/submerged-island/将所有孤岛沉没Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/summary/https://shouyu.xyz/blog/summary/哈希表理论基础总结Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/target-sum/https://shouyu.xyz/blog/target-sum/目标和问题：01背包与回溯算法Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/the-long-season-a-review/https://shouyu.xyz/blog/the-long-season-a-review/A deep dive into the cinematography and storytelling of The Long SeasonThu, 01 Aug 2024 00:00:00 GMThttps://shouyu.xyz/blog/topological-sorting/https://shouyu.xyz/blog/topological-sorting/拓扑排序：解决有向无环图的线性排序问题Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/uncrossed-lines/https://shouyu.xyz/blog/uncrossed-lines/不相交的线：最长公共子序列问题Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/union-find-theory/https://shouyu.xyz/blog/union-find-theory/并查集理论基础：动态连通性问题Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/unique-bst/https://shouyu.xyz/blog/unique-bst/不同的二叉搜索树：动态规划与卡塔兰数Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/unique-paths/https://shouyu.xyz/blog/unique-paths/不同路径：动态规划路径问题Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/unique-paths-ii/https://shouyu.xyz/blog/unique-paths-ii/不同路径II：带障碍物的路径问题Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/vibecoding-map-course/https://shouyu.xyz/blog/vibecoding-map-course/使用 Next.js + Supabase + Vercel + Z-Pay 从零搭建一个可支付的 Sass 地图制作课程平台，包含完整支付流程、订阅逻辑和部署方案。Fri, 01 May 2026 00:00:00 GMThttps://shouyu.xyz/blog/visual-studio-c-project-recommended-settings/https://shouyu.xyz/blog/visual-studio-c-project-recommended-settings/Visual Studio C++ 项目推荐设置Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/water-flow-problem/https://shouyu.xyz/blog/water-flow-problem/水流问题：深度优先搜索岛屿问题Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/why-i-switched-to-tailwind-css/https://shouyu.xyz/blog/why-i-switched-to-tailwind-css/Utility-first CSS might look ugly at first, but the productivity gains are undeniableSun, 10 Sep 2023 00:00:00 GMThttps://shouyu.xyz/blog/wiggle-subsequence/https://shouyu.xyz/blog/wiggle-subsequence/摆动序列：贪心算法与动态规划Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/wildfire-pm25-respiratory-risks/https://shouyu.xyz/blog/wildfire-pm25-respiratory-risks/野火PM2.5对呼吸系统疾病住院风险的影响研究Thu, 21 Mar 2024 00:00:00 GMThttps://shouyu.xyz/blog/word-break/https://shouyu.xyz/blog/word-break/单词拆分：完全背包问题Sun, 21 Dec 2025 00:00:00 GMThttps://shouyu.xyz/blog/yizhijiaohu-first-interview/https://shouyu.xyz/blog/yizhijiaohu-first-interview/上海弈智交互初面Fri, 17 Apr 2026 00:00:00 GMT