<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Garbage2Beginner的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Garbage2Beginner</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Garbage2Beginner]]></copyright><item><title><![CDATA[一致性利器-幂等]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/129903698</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/129903698</guid><author>Garbage2Beginner</author><pubDate>Sat, 01 Apr 2023 21:48:47 +0800</pubDate><description><![CDATA[对于同一个系统，在同样条件下，一次请求和重复多次请求对资源的影响是一致的，就称该操作为幂等的。]]></description><category></category></item><item><title><![CDATA[高可用利器-限流]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/129803557</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/129803557</guid><author>Garbage2Beginner</author><pubDate>Mon, 27 Mar 2023 20:52:15 +0800</pubDate><description><![CDATA[限流是流量限速（Rate Limit）的简称，是一种常见的系统流量控制方式，它通过限制系统的请求或流量，来保证系统的稳定性和可靠性。对于Server而言，限流保证一部分的请求流量可以得到正常的响应，总好过全部的请求都不能得到响应，甚至导致系统雪崩。]]></description><category></category></item><item><title><![CDATA[平衡二叉搜索树（Balanced Binary Tree）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128728197</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128728197</guid><author>Garbage2Beginner</author><pubDate>Sun, 19 Feb 2023 16:39:15 +0800</pubDate><description><![CDATA[平衡二叉搜索树是一种结构平衡的二叉搜索树，它的每个结点的左右两颗子树的高度差都不超过一的二叉树。]]></description><category></category></item><item><title><![CDATA[Volatile关键字剖析]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128804280</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128804280</guid><author>Garbage2Beginner</author><pubDate>Mon, 30 Jan 2023 16:04:54 +0800</pubDate><description><![CDATA[volatile变量具有保证可见性，不保证原子性以及禁止指令重排的性质。]]></description><category></category></item><item><title><![CDATA[BIO、NIO和AIO剖析]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128782169</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128782169</guid><author>Garbage2Beginner</author><pubDate>Sat, 28 Jan 2023 21:48:27 +0800</pubDate><description><![CDATA[IO模型是操作系统对输入和输出做的一系列规范和实现。常见的三种IO有三种：BIO、NIO、AIO。]]></description><category></category></item><item><title><![CDATA[前缀和（Prefix Sum）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128729540</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128729540</guid><author>Garbage2Beginner</author><pubDate>Thu, 19 Jan 2023 13:23:46 +0800</pubDate><description><![CDATA[前缀和指一个数组的某下标之前的所有数组元素的和（包含其自身）。前缀和分为一维前缀和，以及二维前缀和。前缀和是一种重要的预处理，能够降低算法的时间复杂度。]]></description><category></category></item><item><title><![CDATA[同余及其性质（Congruence）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730363</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730363</guid><author>Garbage2Beginner</author><pubDate>Thu, 19 Jan 2023 13:22:25 +0800</pubDate><description><![CDATA[同余（Congruence Modulo）是数论中的一种等价关系。]]></description><category></category></item><item><title><![CDATA[确定有限状态自动机（Deterministic Finite Automation）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128729617</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128729617</guid><author>Garbage2Beginner</author><pubDate>Thu, 19 Jan 2023 13:21:12 +0800</pubDate><description><![CDATA[确定优先状态自动机（Deterministic Finite Automation, DFA）是一种计算模型。]]></description><category></category></item><item><title><![CDATA[树状数组（Binary Index Tree）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730348</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730348</guid><author>Garbage2Beginner</author><pubDate>Thu, 19 Jan 2023 13:16:10 +0800</pubDate><description><![CDATA[树状数组（Binary Index Tree, BIT）是用用数组来模拟树形结构。]]></description><category></category></item><item><title><![CDATA[桶排序（Bucket sort）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730588</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730588</guid><author>Garbage2Beginner</author><pubDate>Thu, 19 Jan 2023 11:57:26 +0800</pubDate><description><![CDATA[桶排序又称箱排序（Bucket sort），是一个排序算法，工作的原理是将数组分到有限数量的桶里。每个桶再个别排序（可能在使用其他的排序算法），最后依次把各个桶中的记录列出来便得到了有序序列。]]></description><category></category></item><item><title><![CDATA[线段树（Segment Tree）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730616</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730616</guid><author>Garbage2Beginner</author><pubDate>Thu, 19 Jan 2023 11:56:52 +0800</pubDate><description><![CDATA[线段树用于维护区间信息（要求满足结合律）。]]></description><category></category></item><item><title><![CDATA[置换环（Substitution Loop）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730653</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730653</guid><author>Garbage2Beginner</author><pubDate>Thu, 19 Jan 2023 11:53:55 +0800</pubDate><description><![CDATA[置换环可以得到数组排序（可以指定排序方式）所需交换的最小次数。]]></description><category></category></item><item><title><![CDATA[字典树（Trie）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730722</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730722</guid><author>Garbage2Beginner</author><pubDate>Thu, 19 Jan 2023 11:52:05 +0800</pubDate><description><![CDATA[字典树（Trie），也叫前缀树，是一个比较简单的数据结构，用来存储和查询字符串。它的优点是：利用字符串的公共前缀来减少查询时间，最大限度地减少无谓的字符串比较。]]></description><category></category></item><item><title><![CDATA[最大公约数和最小公倍数（GCD & LCM）—简写版]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730729</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730729</guid><author>Garbage2Beginner</author><pubDate>Thu, 19 Jan 2023 11:15:39 +0800</pubDate><description><![CDATA[如果有一个自然数a能被自然数b整除，则称a为b的倍数，b为a的约数。几个自然数公有的约数，叫做这几个自然数的公约数。公约数中最大的一个公约数，称为这几个自然数的最大公约数。
两个或多个整数公有的倍数叫做它们的公倍数，其中除0以外最小的一个公倍数就叫做这几个整数的最小公倍数。]]></description><category></category></item><item><title><![CDATA[KMP算法（Knuth-Morris-Pratt字符串查找算法）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730740</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128730740</guid><author>Garbage2Beginner</author><pubDate>Thu, 19 Jan 2023 10:54:18 +0800</pubDate><description><![CDATA[KMP算法的全称为Knuth-Morris-Pratt字符串查找算法，是可以在文本串s中快速查找模式串p的一种算法。]]></description><category></category></item><item><title><![CDATA[快速排序（Quick Sort）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128727220</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128727220</guid><author>Garbage2Beginner</author><pubDate>Wed, 18 Jan 2023 15:51:29 +0800</pubDate><description><![CDATA[快速排序（英语：Quicksort），又称分区交换排序（partition-exchange sort），简称快排，一种排序算法，最早由东尼·霍尔提出。]]></description><category></category></item><item><title><![CDATA[计数排序（Counting Sort）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128726603</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128726603</guid><author>Garbage2Beginner</author><pubDate>Wed, 18 Jan 2023 15:08:22 +0800</pubDate><description><![CDATA[计数排序是一种牺牲内存空间来换取低时间复杂度的排序算法，同时它也是一种不基于比较的算法。这里的不基于比较指的是数组元素之间不存在比较大小的排序算法，它可以突破基于比较算法的下限。]]></description><category></category></item><item><title><![CDATA[二分查找（Binary Search）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128726555</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128726555</guid><author>Garbage2Beginner</author><pubDate>Wed, 18 Jan 2023 14:59:17 +0800</pubDate><description><![CDATA[二分查找也叫作折半查找。二分查找有两个要求，一个是数列有序，另一个是数列使用顺序存储结构。他的思想很简单，但是在书写过程中如果边界条件无法正确的确定，很容易陷入到循环中无法跳出。]]></description><category></category></item><item><title><![CDATA[二叉搜索树（Binary Search Tree）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128726531</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128726531</guid><author>Garbage2Beginner</author><pubDate>Wed, 18 Jan 2023 14:56:35 +0800</pubDate><description><![CDATA[二叉搜索树又叫二叉排序树、二叉查找树，支持多种操作，包括Search、Minimum、Maximum、Predecessor、Successor、Insert和Delete等操作，且其基本操作所花费的时间与这棵树的高度成正比。]]></description><category></category></item><item><title><![CDATA[二叉堆（Binary Heap）]]></title><link>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128726364</link><guid>https://blog.youkuaiyun.com/Garbage2Beginner/article/details/128726364</guid><author>Garbage2Beginner</author><pubDate>Wed, 18 Jan 2023 14:45:06 +0800</pubDate><description><![CDATA[堆是完全二叉树，最大堆和最小堆是二叉堆的形式，按照最大元素位于根节点排列的二叉堆被称为最大堆，同理按照最小元素位于根节点排列的二叉堆被称为最小堆。]]></description><category></category></item></channel></rss>