<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[online46799的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/online46799</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; online46799]]></copyright><item><title><![CDATA[线段树&IndexTree&AC自动机]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/127899779</link><guid>https://blog.youkuaiyun.com/online46799/article/details/127899779</guid><author>online46799</author><pubDate>Thu, 17 Nov 2022 18:10:54 +0800</pubDate><description><![CDATA[1，一种支持范围整体修改和范围整体查询的数据结构2，解决的问题范畴：大范围信息可以只由左、右两侧信息加工出，而不必遍历左右两个子范围的具体状况。]]></description><category></category></item><item><title><![CDATA[Morris遍历算法]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/127844216</link><guid>https://blog.youkuaiyun.com/online46799/article/details/127844216</guid><author>online46799</author><pubDate>Mon, 14 Nov 2022 18:41:00 +0800</pubDate><description><![CDATA[通过利用原树中大量空闲指针的方式，达到节省空间的目的。一种遍历二叉树的方式，并且时间复杂度。有左孩子，找到左子树上最右的节点。根据这个来搞定先序中序逆序。的右指针指向空，让其指向。Morris算法套路。]]></description><category></category></item><item><title><![CDATA[kmp算法]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/127731708</link><guid>https://blog.youkuaiyun.com/online46799/article/details/127731708</guid><author>online46799</author><pubDate>Mon, 07 Nov 2022 15:37:33 +0800</pubDate><description><![CDATA[这个数组意思比如你到了match最后一个位置 这个位置值为3,3的含义就是123 123 一样,如果和str不匹配你可以回退到match[3]这个位置继续的str比较,不用回退到match[0]比较 因此时间复杂度才可以减少0n。如果一个str,要确定match是否是他的子串，比如从0位置开始匹配,一直匹配,到match最后一位没有匹配到,那么我们就需要从str的1位置继续循环,这是暴力解法.KMP就是对回退做了一个优化.假如我们的match字符串为 1231234 那么会生成一个next数组。]]></description><category></category></item><item><title><![CDATA[斐波那契数列矩阵]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/127619421</link><guid>https://blog.youkuaiyun.com/online46799/article/details/127619421</guid><author>online46799</author><pubDate>Mon, 31 Oct 2022 18:00:23 +0800</pubDate><description><![CDATA[斐波那契数列矩阵]]></description><category></category></item><item><title><![CDATA[单调栈的应用]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/127616577</link><guid>https://blog.youkuaiyun.com/online46799/article/details/127616577</guid><author>online46799</author><pubDate>Mon, 31 Oct 2022 16:54:48 +0800</pubDate><description><![CDATA[单调栈]]></description><category></category></item><item><title><![CDATA[暴力递归到动态规划]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/126938588</link><guid>https://blog.youkuaiyun.com/online46799/article/details/126938588</guid><author>online46799</author><pubDate>Wed, 28 Sep 2022 11:42:18 +0800</pubDate><description><![CDATA[暴力递归到动态规划]]></description><category></category></item><item><title><![CDATA[并查集和图]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/126724846</link><guid>https://blog.youkuaiyun.com/online46799/article/details/126724846</guid><author>online46799</author><pubDate>Fri, 09 Sep 2022 11:18:44 +0800</pubDate><description><![CDATA[并查集和图]]></description><category></category></item><item><title><![CDATA[贪心算法例题]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/126608306</link><guid>https://blog.youkuaiyun.com/online46799/article/details/126608306</guid><author>online46799</author><pubDate>Mon, 05 Sep 2022 15:16:22 +0800</pubDate><description><![CDATA[贪心算法]]></description><category></category></item><item><title><![CDATA[二叉树衍生题目]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/126578533</link><guid>https://blog.youkuaiyun.com/online46799/article/details/126578533</guid><author>online46799</author><pubDate>Tue, 30 Aug 2022 11:08:54 +0800</pubDate><description><![CDATA[二叉树]]></description><category></category></item><item><title><![CDATA[链表衍生算法题]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/126484498</link><guid>https://blog.youkuaiyun.com/online46799/article/details/126484498</guid><author>online46799</author><pubDate>Wed, 24 Aug 2022 15:08:05 +0800</pubDate><description><![CDATA[给定两个可能有环也可能无环的单链表，头节点head1和head2。请实现一个函数，如果两个链表相交，请返回相交的 第一个节点。如果不相交，返回null【要求】如果两个链表长度之和为N，时间复杂度请达到O(N)，额外空间复杂度 请达到O(1)。1.单链表无环直接到null2单链表有环如何判断：快慢指针,快走2步,慢走1步,肯定会在X处相遇,则为有环3单链表入环处如何判断,记录X,将快指针归head,每个指针都依次走1步,会在入环处相遇（数学方法不会证明）]]></description><category></category></item><item><title><![CDATA[算法基础-堆]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/126426112</link><guid>https://blog.youkuaiyun.com/online46799/article/details/126426112</guid><author>online46799</author><pubDate>Mon, 22 Aug 2022 12:02:49 +0800</pubDate><description><![CDATA[堆]]></description><category></category></item><item><title><![CDATA[归并算法衍生的面试题]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/126389638</link><guid>https://blog.youkuaiyun.com/online46799/article/details/126389638</guid><author>online46799</author><pubDate>Wed, 17 Aug 2022 18:31:12 +0800</pubDate><description><![CDATA[归并算法衍生]]></description><category></category></item><item><title><![CDATA[栈和队列的相互翻转]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/126382829</link><guid>https://blog.youkuaiyun.com/online46799/article/details/126382829</guid><author>online46799</author><pubDate>Wed, 17 Aug 2022 16:47:40 +0800</pubDate><description><![CDATA[栈和队列互相转换]]></description><category></category></item><item><title><![CDATA[异或运算简单的运用]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/126363511</link><guid>https://blog.youkuaiyun.com/online46799/article/details/126363511</guid><author>online46799</author><pubDate>Tue, 16 Aug 2022 18:01:28 +0800</pubDate><description><![CDATA[一个数组中有两种数出现了奇数次，其他数都出现了偶数次，怎么找到并打印这两种数]]></description><category></category></item><item><title><![CDATA[算法基础-树]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/126351146</link><guid>https://blog.youkuaiyun.com/online46799/article/details/126351146</guid><author>online46799</author><pubDate>Tue, 16 Aug 2022 10:08:25 +0800</pubDate><description><![CDATA[算法基础需要会的]]></description><category></category></item><item><title><![CDATA[算法基础-链表]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/126344926</link><guid>https://blog.youkuaiyun.com/online46799/article/details/126344926</guid><author>online46799</author><pubDate>Mon, 15 Aug 2022 16:58:52 +0800</pubDate><description><![CDATA[链表基础的算法]]></description><category></category></item><item><title><![CDATA[算法基础-排序]]></title><link>https://blog.youkuaiyun.com/online46799/article/details/126343358</link><guid>https://blog.youkuaiyun.com/online46799/article/details/126343358</guid><author>online46799</author><pubDate>Mon, 15 Aug 2022 13:17:35 +0800</pubDate><description><![CDATA[算法的排序基础,快排,归并等]]></description><category></category></item></channel></rss>