<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_74442610的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_74442610</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_74442610]]></copyright><item><title><![CDATA[常用头文件 | 一些技巧]]></title><link>https://blog.youkuaiyun.com/m0_74442610/article/details/147015580</link><guid>https://blog.youkuaiyun.com/m0_74442610/article/details/147015580</guid><author>m0_74442610</author><pubDate>Sat, 05 Apr 2025 20:53:53 +0800</pubDate><description><![CDATA[【代码】常用头文件。]]></description><category></category></item><item><title><![CDATA[双指针 | 滑动窗口法]]></title><link>https://blog.youkuaiyun.com/m0_74442610/article/details/146965178</link><guid>https://blog.youkuaiyun.com/m0_74442610/article/details/146965178</guid><author>m0_74442610</author><pubDate>Sat, 05 Apr 2025 20:41:28 +0800</pubDate><description><![CDATA[左、右指针分别指向数组/子串的开始位置和终止位置，最初都为0。以左指针为基准，当右指针满足条件时，右移右指针，当右指针不满足条件时，右移左指针。大多数数组、子串问题。]]></description><category></category></item><item><title><![CDATA[数学相关：最大公约数、最小公倍数、判定素数、分解质因数等]]></title><link>https://blog.youkuaiyun.com/m0_74442610/article/details/147008172</link><guid>https://blog.youkuaiyun.com/m0_74442610/article/details/147008172</guid><author>m0_74442610</author><pubDate>Sat, 05 Apr 2025 17:19:36 +0800</pubDate><description><![CDATA[定义一个int型的is_prim数组，用来表示是否为素数，首先初始化is_prim数组全为1。从2开始，如果is_prim[i]=1,则将i的倍数全部标记为非素数。通过检查p的二进制表示中的每一位，决定是否将当前的底数b乘到结果中。如果某一位是 0，则该位对应的幂次不需要乘到结果中。当p不是质数时，找到整数x和y，使得a·x+b·y=gcd(a,p)，如果gcd(a,p)=1，则x是a在模p下的逆元。唯一分解定理：每个大于1的正整数都能够唯一的表示成它的质因数的乘积。是a在模p下的乘法逆元。]]></description><category></category></item><item><title><![CDATA[已学算法列表]]></title><link>https://blog.youkuaiyun.com/m0_74442610/article/details/146643763</link><guid>https://blog.youkuaiyun.com/m0_74442610/article/details/146643763</guid><author>m0_74442610</author><pubDate>Sat, 29 Mar 2025 11:43:47 +0800</pubDate><description><![CDATA[1. 一维/二维前缀和。2. 一维/二维差分。]]></description><category></category></item><item><title><![CDATA[广度优先搜索BFS]]></title><link>https://blog.youkuaiyun.com/m0_74442610/article/details/146608902</link><guid>https://blog.youkuaiyun.com/m0_74442610/article/details/146608902</guid><author>m0_74442610</author><pubDate>Fri, 28 Mar 2025 20:39:15 +0800</pubDate><description><![CDATA[②每走一格，就将该层所有能走的格子标记起来（第n层距离起点的边数为n），可以看作BFS树在向四面八方扩张。①是否存在从A到B的路径。②是否存在或者找出从A到B的。①0可以走，1不能走。]]></description><category></category></item><item><title><![CDATA[AI Agent（智能体）]]></title><link>https://blog.youkuaiyun.com/m0_74442610/article/details/146522957</link><guid>https://blog.youkuaiyun.com/m0_74442610/article/details/146522957</guid><author>m0_74442610</author><pubDate>Wed, 26 Mar 2025 11:20:25 +0800</pubDate><description><![CDATA[AI Agent：能够模拟人类的思考和行为，来自动执行任务，以解决复杂问题的程序/系统。]]></description><category></category></item><item><title><![CDATA[递推/递归 + 深度优先搜索DFS]]></title><link>https://blog.youkuaiyun.com/m0_74442610/article/details/146397433</link><guid>https://blog.youkuaiyun.com/m0_74442610/article/details/146397433</guid><author>m0_74442610</author><pubDate>Thu, 20 Mar 2025 21:02:26 +0800</pubDate><description><![CDATA[按字典序输出n的全排列的所有可能方案。（例如132>123，则先输出123，再输出132），先枚举第一个位置，再第二个，最后第三个。在递归函数dfs()里，先写边界条件。]]></description><category></category></item><item><title><![CDATA[记忆化搜索]]></title><link>https://blog.youkuaiyun.com/m0_74442610/article/details/146392640</link><guid>https://blog.youkuaiyun.com/m0_74442610/article/details/146392640</guid><author>m0_74442610</author><pubDate>Thu, 20 Mar 2025 12:04:44 +0800</pubDate><description><![CDATA[检查当前子问题是否被计算过（dp[i]!，防止在搜索的过程中重复计算。]]></description><category></category></item><item><title><![CDATA[STL注意事项]]></title><link>https://blog.youkuaiyun.com/m0_74442610/article/details/146381841</link><guid>https://blog.youkuaiyun.com/m0_74442610/article/details/146381841</guid><author>m0_74442610</author><pubDate>Wed, 19 Mar 2025 22:01:39 +0800</pubDate><description><![CDATA[STL]]></description><category></category></item><item><title><![CDATA[二进制枚举]]></title><link>https://blog.youkuaiyun.com/m0_74442610/article/details/146381322</link><guid>https://blog.youkuaiyun.com/m0_74442610/article/details/146381322</guid><author>m0_74442610</author><pubDate>Wed, 19 Mar 2025 21:41:40 +0800</pubDate><description><![CDATA[有n个物品，每个物品选或不选，1代表选，0代表不选，共有。]]></description><category></category></item><item><title><![CDATA[二分查找/搜索]]></title><link>https://blog.youkuaiyun.com/m0_74442610/article/details/146375115</link><guid>https://blog.youkuaiyun.com/m0_74442610/article/details/146375115</guid><author>m0_74442610</author><pubDate>Wed, 19 Mar 2025 21:24:42 +0800</pubDate><description><![CDATA[1. 左闭右闭 [left , right]2. 左闭右开 [left , right)：O(logn)，其中 n 是数组的长度。：在有序数组中查找特定元素。：不断地把数组分成两半。]]></description><category></category></item></channel></rss>