<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[a695484357的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a695484357</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a695484357]]></copyright><item><title><![CDATA[手写Redis分布式锁（二）]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/129733102</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/129733102</guid><author>a695484357</author><pubDate>Thu, 23 Mar 2023 16:10:30 +0800</pubDate><description><![CDATA[至此我们手写的Redis分布式锁已经具备了独占性、高可用、防死锁、不乱抢、重入性。但是当我们用来进行加锁解锁操作的Redis挂掉怎么办？Redisson 分布式锁可以解决这个问题。]]></description><category></category></item><item><title><![CDATA[手写Redis分布式锁（一）]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/129733009</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/129733009</guid><author>a695484357</author><pubDate>Thu, 23 Mar 2023 16:07:45 +0800</pubDate><description><![CDATA[​	假设在购物场景，有两个服务同时让库存减少，那么普通的synchronize或者lock就不起作用了，因为synchronize只能保证一个jvm里的线程安全，此时两个服务处于不同的jvm中，资源类（库存）在不同的服务器之间共享了，这时synchronize就会失效，所以需要分布式锁来解决这个问题。​	在案例二中，我们貌似已经实现了分布式锁，但仍旧这样一个问题：在删除锁时，if判断与删除操作并不具备。客户端加锁之后，如果没有主动释放自己创建的锁（只能释放自己所创建的锁，为了。表示创建一个键值对为。]]></description><category></category></item><item><title><![CDATA[LeetCode.M139.单词拆分]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126749710</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126749710</guid><author>a695484357</author><pubDate>Wed, 07 Sep 2022 16:59:17 +0800</pubDate><description><![CDATA[LeetCode.M139.单词拆分]]></description><category></category></item><item><title><![CDATA[LeetCode.M128.最长连续序列]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126731836</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126731836</guid><author>a695484357</author><pubDate>Tue, 06 Sep 2022 19:19:41 +0800</pubDate><description><![CDATA[LeetCode.M128.最长连续序列]]></description><category></category></item><item><title><![CDATA[AcWing837连通块中点的数量]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126731737</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126731737</guid><author>a695484357</author><pubDate>Tue, 06 Sep 2022 19:11:08 +0800</pubDate><description><![CDATA[题目链接：https://www.acwing.com/problem/content/839/]]></description><category></category></item><item><title><![CDATA[LeetCode.H828.统计子串中的唯一字符]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126720570</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126720570</guid><author>a695484357</author><pubDate>Tue, 06 Sep 2022 10:53:52 +0800</pubDate><description><![CDATA[LeetCode.H828.统计子串中的唯一字符]]></description><category></category></item><item><title><![CDATA[LeetCode.M652.寻找重复的子树]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126707813</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126707813</guid><author>a695484357</author><pubDate>Mon, 05 Sep 2022 16:19:36 +0800</pubDate><description><![CDATA[LeetCode.M652.寻找重复的子树]]></description><category></category></item><item><title><![CDATA[LeetCode.H124.二叉树中的最大路径和]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126678459</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126678459</guid><author>a695484357</author><pubDate>Sat, 03 Sep 2022 15:48:47 +0800</pubDate><description><![CDATA[LeetCode.H124.二叉树中的最大路径和]]></description><category></category></item><item><title><![CDATA[LeetCode.M687.最长同值路径]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126657798</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126657798</guid><author>a695484357</author><pubDate>Fri, 02 Sep 2022 10:39:00 +0800</pubDate><description><![CDATA[LeetCode.M687.最长同值路径]]></description><category></category></item><item><title><![CDATA[LeetCode.H85.最大矩形]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126652811</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126652811</guid><author>a695484357</author><pubDate>Thu, 01 Sep 2022 22:43:32 +0800</pubDate><description><![CDATA[LeetCode.H85.最大矩形]]></description><category></category></item><item><title><![CDATA[LeetCode.H76.最小覆盖子串]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126651663</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126651663</guid><author>a695484357</author><pubDate>Thu, 01 Sep 2022 21:22:34 +0800</pubDate><description><![CDATA[LeetCode.H76.最小覆盖子串]]></description><category></category></item><item><title><![CDATA[LeetCode.H84.柱状图中最大的矩形]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126650733</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126650733</guid><author>a695484357</author><pubDate>Thu, 01 Sep 2022 20:24:58 +0800</pubDate><description><![CDATA[LeetCode.H84.柱状图中最大的矩形]]></description><category></category></item><item><title><![CDATA[LeetCode.H72.编辑距离]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126625222</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126625222</guid><author>a695484357</author><pubDate>Wed, 31 Aug 2022 15:40:34 +0800</pubDate><description><![CDATA[LeetCode.H72.编辑距离]]></description><category></category></item><item><title><![CDATA[LeetCode.M62.不同路径]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126601556</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126601556</guid><author>a695484357</author><pubDate>Tue, 30 Aug 2022 12:47:08 +0800</pubDate><description><![CDATA[LeetCode.M62.不同路径]]></description><category></category></item><item><title><![CDATA[AcWing793高精度乘法]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126574212</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126574212</guid><author>a695484357</author><pubDate>Sun, 28 Aug 2022 20:51:22 +0800</pubDate><description><![CDATA[题目链接：https://www.acwing.com/problem/content/description/795/]]></description><category></category></item><item><title><![CDATA[LeetCode.H793.阶乘函数后K个零]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126570319</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126570319</guid><author>a695484357</author><pubDate>Sun, 28 Aug 2022 15:24:55 +0800</pubDate><description><![CDATA[LeetCode.H793.阶乘函数后K个零]]></description><category></category></item><item><title><![CDATA[LeetCode.M172.阶乘后的零]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126569508</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126569508</guid><author>a695484357</author><pubDate>Sun, 28 Aug 2022 14:24:48 +0800</pubDate><description><![CDATA[LeetCode.M172.阶乘后的零]]></description><category></category></item><item><title><![CDATA[LeetCode.M662.二叉树最大宽度]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126558330</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126558330</guid><author>a695484357</author><pubDate>Sat, 27 Aug 2022 15:09:21 +0800</pubDate><description><![CDATA[LeetCode.M662.二叉树最大宽度]]></description><category></category></item><item><title><![CDATA[LeetCode.M658.找到K个最接近的元素]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126526124</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126526124</guid><author>a695484357</author><pubDate>Thu, 25 Aug 2022 15:35:25 +0800</pubDate><description><![CDATA[LeetCode.M658.找到K个最接近的元素]]></description><category></category></item><item><title><![CDATA[LeetCode.M33.搜索旋转排序数组]]></title><link>https://blog.youkuaiyun.com/a695484357/article/details/126509570</link><guid>https://blog.youkuaiyun.com/a695484357/article/details/126509570</guid><author>a695484357</author><pubDate>Wed, 24 Aug 2022 17:46:38 +0800</pubDate><description><![CDATA[LeetCode.M33.搜索旋转排序数组]]></description><category></category></item></channel></rss>