<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ShowMeTheCod3的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ShowMeTheCod3</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ShowMeTheCod3]]></copyright><item><title><![CDATA[365天搞定八股文——Day 005 MQ中的重要概念]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/133220843</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/133220843</guid><author>ShowMeTheCod3</author><pubDate>Sat, 23 Sep 2023 23:06:10 +0800</pubDate><description><![CDATA[优先级队列：优先级高的消息有优先被消费的特权，该模式只有在生产效率高于消费效率的时候才有效果
延迟队列：生产者生产完消息后，不能马上进行消费
死信队列：某些消息无法被正常地消费，所以就没有办法被确认，为了防止该消息不断地被回滚在队尾，造成死循环，专门设置了死信队列，存储这类消息
重试队列：消费消息失败后，为防止消息丢弃，回滚到Broker中去
消费模式：推模式和拉模式
消息回溯：消息可以被反复地消费，kafka和RocketMQ支持，而RabbitMQ并不支持
消息堆积 + 持久化：内存式堆积和磁盘式堆积]]></description><category></category></item><item><title><![CDATA[365天搞定八股文——Day 004 MQ解决了哪些痛点]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/133185035</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/133185035</guid><author>ShowMeTheCod3</author><pubDate>Fri, 22 Sep 2023 20:32:18 +0800</pubDate><description><![CDATA[传统的API交互，会导致系统之间耦合性太强。MQ减少了系统之间的关联。]]></description><category></category></item><item><title><![CDATA[365天搞定八股文——Day 003 内核态和用户态之间如何切换]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/133149175</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/133149175</guid><author>ShowMeTheCod3</author><pubDate>Thu, 21 Sep 2023 21:21:54 +0800</pubDate><description><![CDATA[处理器从用户态切换到内核态的方法有三种：系统调用、异常和外部中断。]]></description><category></category></item><item><title><![CDATA[365天搞定八股文——Day 002 内核态和用户态的区别]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/133088601</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/133088601</guid><author>ShowMeTheCod3</author><pubDate>Wed, 20 Sep 2023 17:03:54 +0800</pubDate><description><![CDATA[内核态是操作系统管理程序执行时所处的状态，能够执行包含特权指令在内的一切指令，能够访问系统内所有的存储空间。为了避免操作系统和关键数据被用户程序破坏，将处理器的执行状态分为内核态和用户态。用户态是用户程序执行时处理器所处的状态，不能执行特权指令，只能访问用户地址空间。用户程序运行在用户态,操作系统内核运行在内核态。]]></description><category></category></item><item><title><![CDATA[365天搞定八股文——Day 001 进程和线程的区别]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/133018351</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/133018351</guid><author>ShowMeTheCod3</author><pubDate>Tue, 19 Sep 2023 11:00:26 +0800</pubDate><description><![CDATA[去年我发起了365天挑战leetcode1000题，现在已经完成了。在算法题方面，我认为已经打下了很好的基础。接下来就是准备八股文了，我计划每天整理一条八股文的问题，这样365天就会有365个问题的解答了。]]></description><category></category></item><item><title><![CDATA[美团后端一面面经 23.3.16]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/129589373</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/129589373</guid><author>ShowMeTheCod3</author><pubDate>Thu, 16 Mar 2023 16:13:55 +0800</pubDate><description><![CDATA[一共53分钟，算法题花了30分钟。]]></description><category></category></item><item><title><![CDATA[美团后端一面准备——面试模板]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/129568617</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/129568617</guid><author>ShowMeTheCod3</author><pubDate>Wed, 15 Mar 2023 21:42:02 +0800</pubDate><description><![CDATA[面试官好，我是xxx，首先很荣幸能够参加美团的面试，下面开始我的自我介绍。我是xx大学计算机专业大三的学生，在大学的三年里，我积累了计算机学科的基础知识，养成了比较好的编程习惯，锻炼了自己的人际交往能力和组织能力。在理论学习上，我认真学习了计算机专业理论知识，同时会扩展自己的知识面，学习课外的计算机书籍和课程，我成绩排名第x，位于专业前x%，获得过xx奖学金各一次。]]></description><category></category></item><item><title><![CDATA[365天挑战LeetCode1000题——Day 264 周赛336]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/129483486</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/129483486</guid><author>ShowMeTheCod3</author><pubDate>Mon, 13 Mar 2023 00:02:56 +0800</pubDate><description><![CDATA[【代码】365天挑战LeetCode1000题——Day 264 周赛336。]]></description><category></category></item><item><title><![CDATA[365天挑战LeetCode1000题——Day 261 前缀和 + 哈希表]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/129423115</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/129423115</guid><author>ShowMeTheCod3</author><pubDate>Thu, 09 Mar 2023 15:00:54 +0800</pubDate><description><![CDATA[记录每个位置的1和0的差的个数，如果以前出现过这个数，那么答案有可能就是二者的差。]]></description><category></category></item><item><title><![CDATA[365天挑战LeetCode1000题——Day 260 800题]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/129411997</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/129411997</guid><author>ShowMeTheCod3</author><pubDate>Wed, 08 Mar 2023 21:26:45 +0800</pubDate><description><![CDATA[今天完成了第八百道题，然后距离我的365天千题计划，还剩下100天左右，每天再保持两题的刷题量，就能完成我一年前定下的目标了。这也再次证明了目标的重要性，定下一个可量化的目标，然后持之以恒地努力，不到一年，就能发现自己完全不一样了。接下来我会尽量保持每天更新leetcode的题目，尽量整理出来一些好东西供大家参考。另一方面，由于暑假要考虑夏令营推免，所以会更新一些关于保研笔试面试的东西，看看吧，我看有些博主把各科内容整理出来，还弄成了付费的模式。时过但境还没迁，一晃眼过去了4个月，在同样的位置发了博客。]]></description><category></category></item><item><title><![CDATA[365天挑战LeetCode1000题——Day 154 Knight]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/128012248</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/128012248</guid><author>ShowMeTheCod3</author><pubDate>Thu, 24 Nov 2022 09:50:25 +0800</pubDate><description><![CDATA[154天，12次竞赛，573道题目，拿到了knight。算是到了新的一个阶段吧，正好接下来四周应该都打不了了，因为周末有实验课。]]></description><category></category></item><item><title><![CDATA[365天挑战LeetCode1000题——Day 129 第90场双周赛]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127622189</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127622189</guid><author>ShowMeTheCod3</author><pubDate>Mon, 31 Oct 2022 19:56:53 +0800</pubDate><description><![CDATA[【代码】365天挑战LeetCode1000题——Day 129 第90场双周赛。]]></description><category></category></item><item><title><![CDATA[365天挑战LeetCode1000题——Day 126 单调栈模板 500题纪念]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127578721</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127578721</guid><author>ShowMeTheCod3</author><pubDate>Fri, 28 Oct 2022 20:49:48 +0800</pubDate><description><![CDATA[用时126天，完成500题，平均4题/天，照这个速率，我还需要四个月完成1000题挑战。]]></description><category></category></item><item><title><![CDATA[365天挑战LeetCode1000题——Day 124 单调队列模板]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127529923</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127529923</guid><author>ShowMeTheCod3</author><pubDate>Wed, 26 Oct 2022 12:00:16 +0800</pubDate><description><![CDATA[【代码】365天挑战LeetCode1000题——Day 124 单调队列模板。]]></description><category></category></item><item><title><![CDATA[365天挑战LeetCode1000题——Day 120 基于时间的最大报酬问题模板]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127458681</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127458681</guid><author>ShowMeTheCod3</author><pubDate>Sat, 22 Oct 2022 10:34:31 +0800</pubDate><description><![CDATA[思路：动态规划 + 二分查找。]]></description><category></category></item><item><title><![CDATA[365天挑战LeetCode1000题——Day 117 数位DP II]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127411224</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127411224</guid><author>ShowMeTheCod3</author><pubDate>Wed, 19 Oct 2022 16:45:21 +0800</pubDate><description><![CDATA[【代码】365天挑战LeetCode1000题——Day 117 数位DP II。]]></description><category></category></item><item><title><![CDATA[365天挑战LeetCode1000题——Day 117 数位DP I]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127393235</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127393235</guid><author>ShowMeTheCod3</author><pubDate>Tue, 18 Oct 2022 17:39:06 +0800</pubDate><description><![CDATA[【代码】365天挑战LeetCode1000题——Day 117 数位DP I。]]></description><category></category></item><item><title><![CDATA[365天挑战LeetCode1000题——Day 117 矩形区域不超过 K 的最大数值和]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127376330</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127376330</guid><author>ShowMeTheCod3</author><pubDate>Mon, 17 Oct 2022 21:00:32 +0800</pubDate><description><![CDATA[【代码】365天挑战LeetCode1000题——Day 117 矩形区域不超过 K 的最大数值和。]]></description><category></category></item><item><title><![CDATA[365天挑战LeetCode1000题——Day 116 第315场周赛 「中国银联 & 力扣」]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127345821</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127345821</guid><author>ShowMeTheCod3</author><pubDate>Sun, 16 Oct 2022 12:00:28 +0800</pubDate><description><![CDATA[【代码】365天挑战LeetCode1000题——Day 116 第315场周赛 「中国银联 & 力扣」]]></description><category></category></item><item><title><![CDATA[365天挑战LeetCode1000题——Day 111 归并排序 II]]></title><link>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127279100</link><guid>https://blog.youkuaiyun.com/ShowMeTheCod3/article/details/127279100</guid><author>ShowMeTheCod3</author><pubDate>Wed, 12 Oct 2022 11:14:21 +0800</pubDate><description><![CDATA[【代码】365天挑战LeetCode1000题——Day 111 归并排序 II。]]></description><category></category></item></channel></rss>