<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[bigBbug的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/bigBbug</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; bigBbug]]></copyright><item><title><![CDATA[USTC-Emerald实验室基本操作手册]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/154075215</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/154075215</guid><author>bigBbug</author><pubDate>Wed, 29 Oct 2025 17:05:36 +0800</pubDate><description><![CDATA[实验室基本操作指南]]></description><category></category></item><item><title><![CDATA[十大排序（代码+注释）]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/136510986</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/136510986</guid><author>bigBbug</author><pubDate>Wed, 06 Mar 2024 16:49:20 +0800</pubDate><description><![CDATA[十大排序]]></description><category></category></item><item><title><![CDATA[探讨计算机内存管理：分页与分段的地址空间维度差异（为什么分页机制中逻辑地址空间是一维的，而分段机制中逻辑地址空间是二维的？）]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/134405666</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/134405666</guid><author>bigBbug</author><pubDate>Tue, 14 Nov 2023 19:15:12 +0800</pubDate><description><![CDATA[在计算机系统中，内存管理是一个至关重要的组成部分，而分页机制和分段机制是两种常见的内存管理方式。一个引人疑惑的问题是：为什么分页机制中逻辑地址空间是一维的，而分段机制中逻辑地址空间是二维的呢？在本文中，我们将深入探讨这个问题，并解释这两种不同的地址空间维度。]]></description><category></category></item><item><title><![CDATA[二叉树前序、中序、后序遍历（递归、非递归）]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/133466804</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/133466804</guid><author>bigBbug</author><pubDate>Sun, 01 Oct 2023 20:12:10 +0800</pubDate><description><![CDATA[【代码】二叉树前序、中序、后序遍历（递归法、多种迭代法）]]></description><category></category></item><item><title><![CDATA[LeetCode 822. 翻转卡片游戏]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/132055771</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/132055771</guid><author>bigBbug</author><pubDate>Wed, 02 Aug 2023 10:15:21 +0800</pubDate><description><![CDATA[哈希]]></description><category></category></item><item><title><![CDATA[使用std::clamp函数判断圆和矩形是否重叠]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/131374277</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/131374277</guid><author>bigBbug</author><pubDate>Sun, 25 Jun 2023 11:37:23 +0800</pubDate><description><![CDATA[std::clamp函数是C++标准库中的一个函数模板，用于限制给定值的范围在指定的上下限之间。std::clamp接受三个参数：value、lo和hi。它返回一个被限制在[lo, hi]范围内的值。如果value小于lo，则返回lo；如果value大于hi，则返回hi；否则返回value。本文介绍了如何使用C++标准库中的std::clamp函数来判断给定圆和矩形是否重叠。我们首先了解了题目的描述，然后详细介绍了std::clamp函数的用法。]]></description><category></category></item><item><title><![CDATA[面试题 16.19. 水域大小]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/131339697</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/131339697</guid><author>bigBbug</author><pubDate>Thu, 22 Jun 2023 12:21:06 +0800</pubDate><description><![CDATA[本篇博客我们讨论了 LeetCode 上的面试题 16.19 水域大小。我们介绍了问题的背景和详细描述，并给出了两种解决方案，分别使用深度优先搜索（DFS）和广度优先搜索（BFS）。我们给出了具体的代码实现，并对解决方案进行了详细的解释。希望这篇博客对你理解和解决这道问题有所帮助。如果你有任何疑问或建议，请随时在评论区提出。]]></description><category></category></item><item><title><![CDATA[ip数据报计算首部检验和]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/130497524</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/130497524</guid><author>bigBbug</author><pubDate>Fri, 05 May 2023 00:08:15 +0800</pubDate><description><![CDATA[需要注意的是，在计算IP数据包首部检验和时，应该将源地址和目的地址转换成网络字节序，即大端序。网络字节序是一种规范化的字节序，用于在网络中传输数据，它的顺序与我们平时使用的主机字节序是不同的。当我们在使用互联网进行数据传输时，数据可能会被篡改或者损坏。为了保证数据传输的可靠性和完整性，计算IP数据包首部检验和是一种非常重要的校验机制。本文将会介绍计算IP数据包首部检验和的方法。首先，我们需要了解IP数据包首部的结构。]]></description><category></category></item><item><title><![CDATA[用Java写一个关机程序（图形化界面）]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/130456745</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/130456745</guid><author>bigBbug</author><pubDate>Mon, 01 May 2023 16:12:38 +0800</pubDate><description><![CDATA[图像化界面关机小程序]]></description><category></category></item><item><title><![CDATA[【LeetCode】1031. 两个非重叠子数组的最大和]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/130395667</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/130395667</guid><author>bigBbug</author><pubDate>Wed, 26 Apr 2023 22:13:03 +0800</pubDate><description><![CDATA[STL，滑动窗口。]]></description><category></category></item><item><title><![CDATA[【LeetCode】2418.按身高排序]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/130375043</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/130375043</guid><author>bigBbug</author><pubDate>Tue, 25 Apr 2023 22:23:19 +0800</pubDate><description><![CDATA[哈希表、排序算法]]></description><category></category></item><item><title><![CDATA[Java中的Map(三种双列集合万字详解)]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/130244690</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/130244690</guid><author>bigBbug</author><pubDate>Wed, 19 Apr 2023 21:13:33 +0800</pubDate><description><![CDATA[双列集合HashMap、LinkedHashMap、TreeMap详解]]></description><category></category></item><item><title><![CDATA[虚拟机打开3306端口或者关闭防火墙实现MySQL远程连接]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/130138202</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/130138202</guid><author>bigBbug</author><pubDate>Thu, 13 Apr 2023 19:55:24 +0800</pubDate><description><![CDATA[远程连接SUCCESS]]></description><category></category></item><item><title><![CDATA[SQL优化（万字详解）]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/130087216</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/130087216</guid><author>bigBbug</author><pubDate>Tue, 11 Apr 2023 22:09:09 +0800</pubDate><description><![CDATA[SQL优化（七个优化）]]></description><category></category></item><item><title><![CDATA[并发事务问题（脏读、不可重复读、幻读）]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/129984787</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/129984787</guid><author>bigBbug</author><pubDate>Thu, 06 Apr 2023 11:04:04 +0800</pubDate><description><![CDATA[数据库的脏读和写脏数据是数据库事务中一个非常重要的概念。在多用户的数据库系统中，为了避免数据不一致，数据库系统需要支持事务的隔离级别。而脏读和写脏数据是隔离级别中的最低级别，意味着事务可以读取或写入未被提交的数据。]]></description><category></category></item><item><title><![CDATA[SQL索引失效情况]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/129939651</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/129939651</guid><author>bigBbug</author><pubDate>Mon, 03 Apr 2023 21:48:44 +0800</pubDate><description><![CDATA[SQL索引失效汇总]]></description><category></category></item><item><title><![CDATA[SQL中的函数（字符串、数值、日期、流程函数）]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/129784725</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/129784725</guid><author>bigBbug</author><pubDate>Sun, 26 Mar 2023 21:43:28 +0800</pubDate><description><![CDATA[SQL基础篇函数：字符串、数值、日期、流程函数。]]></description><category></category></item><item><title><![CDATA[[LeetCode]1605. 给定行和列的和求可行矩阵]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/129524394</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/129524394</guid><author>bigBbug</author><pubDate>Tue, 14 Mar 2023 13:10:44 +0800</pubDate><description><![CDATA[贪心]]></description><category></category></item><item><title><![CDATA[【LeetCode】2383. 赢得比赛需要的最少训练时长]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/129506084</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/129506084</guid><author>bigBbug</author><pubDate>Mon, 13 Mar 2023 20:50:47 +0800</pubDate><description><![CDATA[贪心]]></description><category></category></item><item><title><![CDATA[[LeetCode]面试题 17.05. 字母与数字]]></title><link>https://blog.youkuaiyun.com/bigBbug/article/details/129470985</link><guid>https://blog.youkuaiyun.com/bigBbug/article/details/129470985</guid><author>bigBbug</author><pubDate>Sun, 12 Mar 2023 00:07:30 +0800</pubDate><description><![CDATA[思路：每个字母对应1，数字对应-1，寻找长度为0的子数组。其中的更新方法就是遍历，找到相同的sum，sum之间的所有数便是一个新的子数组，判断是否更新最大子数组即可。返回该子数组，若存在多个最长子数组，返回左端点下标值最小的子数组。若不存在这样的数组，返回一个空数组。给定一个放有字母和数字的数组，找到最长的子数组，且包含的字母和数字的个数相同。]]></description><category></category></item></channel></rss>