<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_71894372的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_71894372</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_71894372]]></copyright><item><title><![CDATA[过滤器和拦截器的配置方式]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/139042160</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/139042160</guid><author>m0_71894372</author><pubDate>Sun, 19 May 2024 14:11:57 +0800</pubDate><description><![CDATA[【代码】过滤器和拦截器的配置方式。]]></description><category></category></item><item><title><![CDATA[今日八股-01]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/138000875</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/138000875</guid><author>m0_71894372</author><pubDate>Sat, 20 Apr 2024 15:44:28 +0800</pubDate><description><![CDATA[主库在事务提交的时候，会将数据变更记录在二进制日志文件binlog中，从库读取主库的binlog文件，写入到从库的中继日志RelayLog中，从库重做中继日志中的事件，从而完成数据的同步。：将不常用的字段拆分出来单独放在一张表中，把text、blob等大字段拆分出来单独放在一张表中。：将一个表中的数据拆分到多个表中。根据路由规则将数据存储到不同的表中，优化了单一表数据量过大而产生的性能问题，避免了IO争抢并减少锁表几率。：将一个数据库中的数据拆分到不同的数据库中。根据不同的业务将不同表拆分到不同的库中。]]></description><category></category></item><item><title><![CDATA[spring的refresh]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/137853986</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/137853986</guid><author>m0_71894372</author><pubDate>Wed, 17 Apr 2024 08:16:33 +0800</pubDate><description><![CDATA[5. **注册Bean后处理器**：注册实现了`BeanPostProcessor`接口的Bean后处理器，这些后处理器可以在Bean的初始化前后执行自定义逻辑。8. **初始化其他特殊Bean**：根据配置初始化其他特殊的Bean，如`ApplicationListeners`。10. **注册Bean的销毁钩子**：注册Bean的销毁钩子，以便在应用上下文关闭时能够正确地销毁Bean。1. **准备刷新**：记录应用上下文的启动时间，设置活跃状态为`true`，并准备一个事件发布器。]]></description><category></category></item><item><title><![CDATA[排序算法。]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/137809695</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/137809695</guid><author>m0_71894372</author><pubDate>Tue, 16 Apr 2024 12:18:15 +0800</pubDate><description><![CDATA[将数组划分为有序和无序，每一轮都选择一个最小的值加入到已排序部分。]]></description><category></category></item><item><title><![CDATA[设计模式之单例模式]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/137793989</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/137793989</guid><author>m0_71894372</author><pubDate>Mon, 15 Apr 2024 22:51:43 +0800</pubDate><description><![CDATA[多线程破坏单例使用DCL+voliatle预防，反射破坏单例使用在构造方法处检查对象是否存在进行预防，实现序列化接口破坏单例使用实现readResolve方法，返回已经创建的单例对象。unsafe目前还没有预防的方式。]]></description><category></category></item><item><title><![CDATA[代码随想录-二叉树]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/137742464</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/137742464</guid><author>m0_71894372</author><pubDate>Sun, 14 Apr 2024 21:59:45 +0800</pubDate><description><![CDATA[递归：可以使用递归的大多都可以使用栈进行迭代。]]></description><category></category></item><item><title><![CDATA[代码随想录-单调栈]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/137724153</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/137724153</guid><author>m0_71894372</author><pubDate>Sun, 14 Apr 2024 12:54:12 +0800</pubDate><description><![CDATA[暴力：当前列雨水面积：min(左边柱子的最高高度，记录右边柱子的最高高度) - 当前柱子高度。]]></description><category></category></item><item><title><![CDATA[代码随想录-KMP算法]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/137650248</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/137650248</guid><author>m0_71894372</author><pubDate>Thu, 11 Apr 2024 19:39:19 +0800</pubDate><description><![CDATA[【代码】代码随想录-KMP算法。]]></description><category></category></item><item><title><![CDATA[代码随想录-动态规划]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/137401365</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/137401365</guid><author>m0_71894372</author><pubDate>Fri, 05 Apr 2024 20:49:08 +0800</pubDate><description><![CDATA[- 力扣（LeetCode）int sum=0;]]></description><category></category></item><item><title><![CDATA[代码随想录-贪心]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/137380242</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/137380242</guid><author>m0_71894372</author><pubDate>Fri, 05 Apr 2024 15:17:35 +0800</pubDate><description><![CDATA[使用变量替换map，效率更高。]]></description><category></category></item><item><title><![CDATA[代码随想录-图论]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/137372114</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/137372114</guid><author>m0_71894372</author><pubDate>Thu, 04 Apr 2024 16:04:45 +0800</pubDate><description><![CDATA[【代码】代码随想录-图论。]]></description><category></category></item><item><title><![CDATA[代码随想录-回溯]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/137245222</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/137245222</guid><author>m0_71894372</author><pubDate>Thu, 04 Apr 2024 12:32:42 +0800</pubDate><description><![CDATA[照猫画虎的竟然写出来了。]]></description><category></category></item><item><title><![CDATA[leetCode-01]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/137194154</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/137194154</guid><author>m0_71894372</author><pubDate>Sun, 31 Mar 2024 20:22:39 +0800</pubDate><description><![CDATA[【代码】leetCode-01。]]></description><category></category></item><item><title><![CDATA[分布式锁的实现方式]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/137139323</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/137139323</guid><author>m0_71894372</author><pubDate>Fri, 29 Mar 2024 11:24:25 +0800</pubDate><description><![CDATA[zookeeper可以创建临时顺序节点来实现锁机制，每个节点尝试创建同一个路径的节点，创建成功的节点获得锁，访问完成后删除节点释放锁。通过数据库中建立一个锁表，每个节点访问共享资源前向表中插入一条记录，成功插入的节点获得锁，访问完成后删除记录释放锁。redis提供了分布式锁的实现方案，比如setnx,redisson。]]></description><category></category></item><item><title><![CDATA[代码随想录day04]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/137120472</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/137120472</guid><author>m0_71894372</author><pubDate>Thu, 28 Mar 2024 20:51:29 +0800</pubDate><description><![CDATA[【代码】代码随想录。]]></description><category></category></item><item><title><![CDATA[学成在线day06]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/136445309</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/136445309</guid><author>m0_71894372</author><pubDate>Wed, 27 Mar 2024 19:20:18 +0800</pubDate><description><![CDATA[Max-request-size: 单次请求的大小限制。max-file-size：单个文件的大小限制。如何根据文件获取本地文件的路径。将分块文件上传到minio。]]></description><category></category></item><item><title><![CDATA[代码随想录day03]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/136973404</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/136973404</guid><author>m0_71894372</author><pubDate>Tue, 26 Mar 2024 21:31:18 +0800</pubDate><description><![CDATA[【代码】代码随想录day03。]]></description><category></category></item><item><title><![CDATA[代码随想录day02]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/136889056</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/136889056</guid><author>m0_71894372</author><pubDate>Sat, 23 Mar 2024 19:22:50 +0800</pubDate><description><![CDATA[最大滑动窗口模板：给定数组nums，定义滑动窗口的左右边界，i,j，求满足某个条件的滑动窗口的最大长度。一下思路来自leetcode题解：leetcode76题球的是最小滑动窗口，本题求解的是最大滑动窗口。最小滑动窗口模板：给定数组nums，定义滑动窗口的作用边界i,j，求满足某个条件的滑动窗口的最小长度。最短子字符串 "BANC" 包含了字符串 t 的所有字符 'A'、'B'、'C's 和 t 都会变成 "ac"。]]></description><category></category></item><item><title><![CDATA[jvm学习]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/136919368</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/136919368</guid><author>m0_71894372</author><pubDate>Fri, 22 Mar 2024 16:02:42 +0800</pubDate><description><![CDATA[定义： Java Virtual Machine - java 程序的运行环境（java二进制字节码的运行环境）好处：一次编写，到处运行自动内存管理，垃圾回收功能数组下标越界检查多态比较： jvm jre jdkjava程序的执行过程:java源码---编译---->java字节码----解释器----->机器码（交给cpu执行）]]></description><category></category></item><item><title><![CDATA[代码随想录day01]]></title><link>https://blog.youkuaiyun.com/m0_71894372/article/details/136873416</link><guid>https://blog.youkuaiyun.com/m0_71894372/article/details/136873416</guid><author>m0_71894372</author><pubDate>Wed, 20 Mar 2024 21:16:10 +0800</pubDate><description><![CDATA[给你一个按照非递减顺序排列的整数数组nums，和一个目标值target。请你找出给定目标值在数组中的开始位置和结束位置。如果数组中不存在目标值target，返回[-1, -1]。思路：就是查找目标元素最左边的元素和最右边的元素。查找最左边元素就是找到目标值后继续向左找，查找最右边元素同理。left=mid+1;. - 力扣（LeetCode）]]></description><category></category></item></channel></rss>