<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sakuraSD的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sakuraSD</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sakuraSD]]></copyright><item><title><![CDATA[写了几个难一点的sql]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/136839786</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/136839786</guid><author>sakuraSD</author><pubDate>Tue, 19 Mar 2024 14:06:25 +0800</pubDate><description><![CDATA[写了几个难一点的sql]]></description><category></category></item><item><title><![CDATA[将数据从MongoDB数据库洗到MySQL数据库]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/128550239</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/128550239</guid><author>sakuraSD</author><pubDate>Wed, 04 Jan 2023 20:09:35 +0800</pubDate><description><![CDATA[数据从MongoDB数据库洗到MySQL数据库]]></description><category></category></item><item><title><![CDATA[对elasticsearch的实际应用]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/128456705</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/128456705</guid><author>sakuraSD</author><pubDate>Mon, 02 Jan 2023 22:58:19 +0800</pubDate><description><![CDATA[对elasticsearch的应用]]></description><category></category></item><item><title><![CDATA[LeetCode 2296 设计一个文本编辑器]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/127215835</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/127215835</guid><author>sakuraSD</author><pubDate>Sat, 08 Oct 2022 20:42:12 +0800</pubDate><description><![CDATA[LeetCode 2296 设计一个文本编辑器]]></description><category></category></item><item><title><![CDATA[LeetCode37 解数独]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/126274917</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/126274917</guid><author>sakuraSD</author><pubDate>Wed, 10 Aug 2022 21:57:45 +0800</pubDate><description><![CDATA[LeetCode37 解数独]]></description><category></category></item><item><title><![CDATA[LeetCode 1195 交替打印字符串]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/126167646</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/126167646</guid><author>sakuraSD</author><pubDate>Thu, 04 Aug 2022 22:21:51 +0800</pubDate><description><![CDATA[LeetCode 1195 交替打印字符串]]></description><category></category></item><item><title><![CDATA[LeetCode236 二叉树的最近公共祖先]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/125126304</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/125126304</guid><author>sakuraSD</author><pubDate>Sat, 04 Jun 2022 22:02:07 +0800</pubDate><description><![CDATA[LeetCode236 二叉树的最近公共祖先]]></description><category></category></item><item><title><![CDATA[LeetCode 1106 解析布尔表达式]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/125113649</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/125113649</guid><author>sakuraSD</author><pubDate>Fri, 03 Jun 2022 16:35:52 +0800</pubDate><description><![CDATA[LeetCode 1106 解析布尔表达式]]></description><category></category></item><item><title><![CDATA[LeetCode 352 将数据流变为多个不相交区间]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/125031784</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/125031784</guid><author>sakuraSD</author><pubDate>Sun, 29 May 2022 15:44:27 +0800</pubDate><description><![CDATA[class SummaryRanges {

    List&lt;List&lt;Integer&gt;&gt; list;
    
    public SummaryRanges() {
        list = new ArrayList&lt;List&lt;Integer&gt;&gt;();
    }
    
    public void addNum(int val) {
        if(list.isEmpty()) {
		List&lt;Integer&gt; t.]]></description><category></category></item><item><title><![CDATA[LeetCode 第432题 全O(1)的数据结构]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/124519783</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/124519783</guid><author>sakuraSD</author><pubDate>Sat, 30 Apr 2022 22:08:21 +0800</pubDate><description><![CDATA[LeetCode 第432题 全O(1)的数据结构]]></description><category></category></item><item><title><![CDATA[LeetCode 第65题 有效数字]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/124134755</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/124134755</guid><author>sakuraSD</author><pubDate>Tue, 12 Apr 2022 21:37:22 +0800</pubDate><description><![CDATA[LeetCode 第65题]]></description><category></category></item><item><title><![CDATA[LeetCode 第1206题 设计跳表]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/124089152</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/124089152</guid><author>sakuraSD</author><pubDate>Mon, 11 Apr 2022 00:14:31 +0800</pubDate><description><![CDATA[LeetCode 第1206题 设计跳表]]></description><category></category></item><item><title><![CDATA[LeetCode 第 48 题 旋转图像]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/123832021</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/123832021</guid><author>sakuraSD</author><pubDate>Tue, 29 Mar 2022 21:15:40 +0800</pubDate><description><![CDATA[LeetCode 第 48 题 旋转图像]]></description><category></category></item><item><title><![CDATA[LeetCode 第19题 删除链表的倒数第 N 个结点]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/123809460</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/123809460</guid><author>sakuraSD</author><pubDate>Mon, 28 Mar 2022 23:24:13 +0800</pubDate><description><![CDATA[LeetCode 第19题  删除链表的倒数第 N 个结点]]></description><category></category></item><item><title><![CDATA[LeetCode 第124题 二叉树中的最大路径和]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/123444092</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/123444092</guid><author>sakuraSD</author><pubDate>Sat, 12 Mar 2022 15:05:45 +0800</pubDate><description><![CDATA[LeetCode 第124题]]></description><category></category></item><item><title><![CDATA[LeetCode 第282题 给表达式添加运算符]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/123166885</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/123166885</guid><author>sakuraSD</author><pubDate>Sun, 27 Feb 2022 17:20:11 +0800</pubDate><description><![CDATA[LeetCode 第282题]]></description><category></category></item><item><title><![CDATA[LeetCode 第149题 直线上最多的点数]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/123158663</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/123158663</guid><author>sakuraSD</author><pubDate>Sun, 27 Feb 2022 00:06:28 +0800</pubDate><description><![CDATA[LeetCode 第149题]]></description><category></category></item><item><title><![CDATA[LeetCode 第140题 单词拆分II]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/123075027</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/123075027</guid><author>sakuraSD</author><pubDate>Tue, 22 Feb 2022 19:10:51 +0800</pubDate><description><![CDATA[LeetCode 第140题]]></description><category></category></item><item><title><![CDATA[LeetCode 第3题 无重复字符的最长子串]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/122994370</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/122994370</guid><author>sakuraSD</author><pubDate>Fri, 18 Feb 2022 00:01:12 +0800</pubDate><description><![CDATA[LeetCode 第3题]]></description><category></category></item><item><title><![CDATA[LeetCode 第82题 删除排序链表中的重复元素II]]></title><link>https://blog.youkuaiyun.com/sakuraSD/article/details/122994328</link><guid>https://blog.youkuaiyun.com/sakuraSD/article/details/122994328</guid><author>sakuraSD</author><pubDate>Thu, 17 Feb 2022 23:56:48 +0800</pubDate><description><![CDATA[LeetCode 第82题]]></description><category></category></item></channel></rss>