<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[w_zero_one的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/w_zero_one</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; w_zero_one]]></copyright><item><title><![CDATA[算法--桶思想]]></title><link>https://blog.csdn.net/w_zero_one/article/details/169169236</link><guid>https://blog.csdn.net/w_zero_one/article/details/169169236</guid><author>w_zero_one</author><pubDate>Tue, 27 Oct 2026 19:00:00 +0800</pubDate><description><![CDATA[谐距下标对；最大 FST 距离]]></description><category></category></item><item><title><![CDATA[算法--排序]]></title><link>https://blog.csdn.net/w_zero_one/article/details/169169201</link><guid>https://blog.csdn.net/w_zero_one/article/details/169169201</guid><author>w_zero_one</author><pubDate>Mon, 26 Oct 2026 21:02:02 +0800</pubDate><description><![CDATA[排序练习；分数线划定；小红书推荐系统]]></description><category></category></item><item><title><![CDATA[模拟（三）]]></title><link>https://blog.csdn.net/w_zero_one/article/details/168772588</link><guid>https://blog.csdn.net/w_zero_one/article/details/168772588</guid><author>w_zero_one</author><pubDate>Sat, 24 Oct 2026 19:00:00 +0800</pubDate><description><![CDATA[纸牌游戏；多项式输出；乒乓球；回文日期]]></description><category></category></item><item><title><![CDATA[模拟（二）]]></title><link>https://blog.csdn.net/w_zero_one/article/details/168772334</link><guid>https://blog.csdn.net/w_zero_one/article/details/168772334</guid><author>w_zero_one</author><pubDate>Fri, 23 Oct 2026 19:00:00 +0800</pubDate><description><![CDATA[特殊的科学计数法；小红的夹吃棋；计算一年中的第几天]]></description><category></category></item><item><title><![CDATA[暴力枚举（一）]]></title><link>https://blog.csdn.net/w_zero_one/article/details/168772253</link><guid>https://blog.csdn.net/w_zero_one/article/details/168772253</guid><author>w_zero_one</author><pubDate>Thu, 22 Oct 2026 19:51:01 +0800</pubDate><description><![CDATA[田忌赛马；小红的字符串修改；变幻莫测；元素方碑；九倍平方数]]></description><category></category></item><item><title><![CDATA[算法--模拟]]></title><link>https://blog.csdn.net/w_zero_one/article/details/168454315</link><guid>https://blog.csdn.net/w_zero_one/article/details/168454315</guid><author>w_zero_one</author><pubDate>Wed, 21 Oct 2026 19:00:00 +0800</pubDate><description><![CDATA[旋转数组；螺旋矩阵；顺时针旋转矩阵；设计LRU缓存结构；设计LFU缓存结构]]></description><category></category></item><item><title><![CDATA[算法--贪心算法]]></title><link>https://blog.csdn.net/w_zero_one/article/details/168454219</link><guid>https://blog.csdn.net/w_zero_one/article/details/168454219</guid><author>w_zero_one</author><pubDate>Tue, 20 Oct 2026 19:00:00 +0800</pubDate><description><![CDATA[分糖果问题；主持人调度]]></description><category></category></item><item><title><![CDATA[双指针（二）]]></title><link>https://blog.csdn.net/w_zero_one/article/details/168334227</link><guid>https://blog.csdn.net/w_zero_one/article/details/168334227</guid><author>w_zero_one</author><pubDate>Mon, 19 Oct 2026 19:00:00 +0800</pubDate><description><![CDATA[反转字符串；最长无重复子数组；盛水最多的容器；接雨水问题]]></description><category></category></item><item><title><![CDATA[双指针（一）]]></title><link>https://blog.csdn.net/w_zero_one/article/details/168333905</link><guid>https://blog.csdn.net/w_zero_one/article/details/168333905</guid><author>w_zero_one</author><pubDate>Sun, 18 Oct 2026 19:00:00 +0800</pubDate><description><![CDATA[合并两个有序的数组；判断是否为回文字符串；合并区间；最小覆盖子串]]></description><category></category></item><item><title><![CDATA[算法--字符串]]></title><link>https://blog.csdn.net/w_zero_one/article/details/168249836</link><guid>https://blog.csdn.net/w_zero_one/article/details/168249836</guid><author>w_zero_one</author><pubDate>Sat, 17 Oct 2026 22:04:22 +0800</pubDate><description><![CDATA[字符串变形；最长公共前缀；验证IP地址；大数加法]]></description><category></category></item><item><title><![CDATA[动态规划（四）]]></title><link>https://blog.csdn.net/w_zero_one/article/details/168144319</link><guid>https://blog.csdn.net/w_zero_one/article/details/168144319</guid><author>w_zero_one</author><pubDate>Fri, 16 Oct 2026 21:13:14 +0800</pubDate><description><![CDATA[打家劫舍(一)；打家劫舍(二)；买卖股票的最好时机(一)；买卖股票的最好时机(二)]]></description><category></category></item><item><title><![CDATA[动态规划（三）]]></title><link>https://blog.csdn.net/w_zero_one/article/details/168029849</link><guid>https://blog.csdn.net/w_zero_one/article/details/168029849</guid><author>w_zero_one</author><pubDate>Thu, 15 Oct 2026 21:00:20 +0800</pubDate><description><![CDATA[数字字符串转化成IP地址；编辑距离；正则表达式匹配；最长的括号子串]]></description><category></category></item><item><title><![CDATA[动态规划（二）]]></title><link>https://blog.csdn.net/w_zero_one/article/details/167874973</link><guid>https://blog.csdn.net/w_zero_one/article/details/167874973</guid><author>w_zero_one</author><pubDate>Wed, 14 Oct 2026 19:00:00 +0800</pubDate><description><![CDATA[矩阵的最小路径和；把数字翻译成字符串；兑换零钱；最长上升子序列；连续子数组的最大和；最长回文子串]]></description><category></category></item><item><title><![CDATA[动态规划（一）]]></title><link>https://blog.csdn.net/w_zero_one/article/details/167810096</link><guid>https://blog.csdn.net/w_zero_one/article/details/167810096</guid><author>w_zero_one</author><pubDate>Tue, 13 Oct 2026 21:30:00 +0800</pubDate><description><![CDATA[斐波那契数列；跳台阶；最小花费爬楼梯；最长公共子序列；最长公共子串；不同路径的数目]]></description><category></category></item><item><title><![CDATA[递归/回溯]]></title><link>https://blog.csdn.net/w_zero_one/article/details/167658398</link><guid>https://blog.csdn.net/w_zero_one/article/details/167658398</guid><author>w_zero_one</author><pubDate>Mon, 12 Oct 2026 19:00:00 +0800</pubDate><description><![CDATA[没有重复项数字的全排列；有重复项数字的全排列；岛屿数量；字符串的排列；N皇后问题；括号生成；矩阵最长递增路径]]></description><category></category></item><item><title><![CDATA[哈希/数组]]></title><link>https://blog.csdn.net/w_zero_one/article/details/167555552</link><guid>https://blog.csdn.net/w_zero_one/article/details/167555552</guid><author>w_zero_one</author><pubDate>Sun, 11 Oct 2026 19:00:00 +0800</pubDate><description><![CDATA[两数之和；数组中出现次数超过一半的数字；数组中只出现一次的两个数字；缺失的第一个正整数；三数之和]]></description><category></category></item><item><title><![CDATA[堆/栈/队列]]></title><link>https://blog.csdn.net/w_zero_one/article/details/167464089</link><guid>https://blog.csdn.net/w_zero_one/article/details/167464089</guid><author>w_zero_one</author><pubDate>Sat, 10 Oct 2026 19:00:00 +0800</pubDate><description><![CDATA[用两个栈实现队列；包含min函数的栈；有效括号序列；滑动窗口的最大值；最小的K个数；寻找第K大；数据流中的中位数；表达式求值]]></description><category></category></item><item><title><![CDATA[二叉树（3）]]></title><link>https://blog.csdn.net/w_zero_one/article/details/167357097</link><guid>https://blog.csdn.net/w_zero_one/article/details/167357097</guid><author>w_zero_one</author><pubDate>Fri, 09 Oct 2026 19:00:00 +0800</pubDate><description><![CDATA[判断是不是完全二叉树；判断是不是平衡二叉树；二叉搜索树的最近公共祖先；在二叉树中找到两个节点的最近公共祖先；序列化二叉树；重建二叉树]]></description><category></category></item><item><title><![CDATA[二叉树（2）]]></title><link>https://blog.csdn.net/w_zero_one/article/details/167258600</link><guid>https://blog.csdn.net/w_zero_one/article/details/167258600</guid><author>w_zero_one</author><pubDate>Thu, 08 Oct 2026 19:00:00 +0800</pubDate><description><![CDATA[二叉树中和为某一值的路径；二叉搜索树与双向链表；对称的二叉树；合并二叉树；二叉树的镜像；判断是不是二叉搜索树]]></description><category></category></item><item><title><![CDATA[ArkTS鸿蒙--WaterFlow瀑布流构建]]></title><link>https://blog.csdn.net/w_zero_one/article/details/167266517</link><guid>https://blog.csdn.net/w_zero_one/article/details/167266517</guid><author>w_zero_one</author><pubDate>Thu, 08 Oct 2026 10:53:07 +0800</pubDate><description><![CDATA[ArkTS鸿蒙中WaterFlow瀑布流构建以及后续的优化建议]]></description><category></category></item></channel></rss>