<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[纸上得来终觉浅]]></title><description><![CDATA[指尖上跳跃的代码]]></description><link>https://blog.youkuaiyun.com/youdu0213</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; youdu0213]]></copyright><item><title><![CDATA[搞清楚 Promise & async/await & 事件循环]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/150583304</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/150583304</guid><author>youdu0213</author><pubDate>Thu, 21 Aug 2025 15:30:22 +0800</pubDate><description><![CDATA[摘要： Promise 和 async/await 的核心原理基于状态机制与任务优先级。Promise 通过不可变状态（pending/fulfilled/rejected）和链式回调管理异步，构造函数同步执行，then 回调异步执行并遵循微任务优先级。async/await 是 Promise 的语法糖，await 会暂停函数执行并注册微任务。事件循环中，执行顺序为同步代码 &gt; 微任务（Promise/await）&gt; 宏任务（setTimeout）。分析时需按“同步→微任务→宏任务”三步拆解，]]></description><category></category></item><item><title><![CDATA[OJ# 376 机器翻译]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131399732</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131399732</guid><author>youdu0213</author><pubDate>Mon, 26 Jun 2023 16:05:51 +0800</pubDate><description><![CDATA[OJ #367 机器翻译]]></description><category></category></item><item><title><![CDATA[OJ# 384 敲七]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131397071</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131397071</guid><author>youdu0213</author><pubDate>Mon, 26 Jun 2023 14:40:48 +0800</pubDate><description><![CDATA[OJ# 384 敲七]]></description><category></category></item><item><title><![CDATA[OJ #382 报数]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131383205</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131383205</guid><author>youdu0213</author><pubDate>Sun, 25 Jun 2023 17:58:03 +0800</pubDate><description><![CDATA[OJ #382 报数]]></description><category></category></item><item><title><![CDATA[OJ #379 仓库日志]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131379339</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131379339</guid><author>youdu0213</author><pubDate>Sun, 25 Jun 2023 16:07:53 +0800</pubDate><description><![CDATA[OJ #379 仓库日志]]></description><category></category></item><item><title><![CDATA[OJ #378 字符串括号匹配2]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131377250</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131377250</guid><author>youdu0213</author><pubDate>Sun, 25 Jun 2023 14:43:24 +0800</pubDate><description><![CDATA[OJ #378 字符串括号匹配2]]></description><category></category></item><item><title><![CDATA[OJ#210.词典排序]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131131677</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131131677</guid><author>youdu0213</author><pubDate>Fri, 09 Jun 2023 17:14:29 +0800</pubDate><description><![CDATA[OJ#210.词典排序]]></description><category></category></item><item><title><![CDATA[OJ #194.两数之和]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131128005</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131128005</guid><author>youdu0213</author><pubDate>Fri, 09 Jun 2023 15:12:37 +0800</pubDate><description><![CDATA[OJ #194.两数之和]]></description><category></category></item><item><title><![CDATA[OJ #193. 是否可以求和]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131123085</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131123085</guid><author>youdu0213</author><pubDate>Fri, 09 Jun 2023 10:59:27 +0800</pubDate><description><![CDATA[OJ #193. 是否可以求和]]></description><category></category></item><item><title><![CDATA[OJ#189.实现折半查找]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131122180</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131122180</guid><author>youdu0213</author><pubDate>Fri, 09 Jun 2023 10:29:46 +0800</pubDate><description><![CDATA[OJ#189.实现折半查找]]></description><category></category></item><item><title><![CDATA[OJ#203.身高排序]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131109714</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131109714</guid><author>youdu0213</author><pubDate>Thu, 08 Jun 2023 15:53:42 +0800</pubDate><description><![CDATA[OJ#203.身高排序]]></description><category></category></item><item><title><![CDATA[OJ #191.素数距离]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131106810</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131106810</guid><author>youdu0213</author><pubDate>Thu, 08 Jun 2023 14:17:42 +0800</pubDate><description><![CDATA[OJ #191.素数距离]]></description><category></category></item><item><title><![CDATA[OJ #190.路飞的猜想]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131101919</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131101919</guid><author>youdu0213</author><pubDate>Thu, 08 Jun 2023 10:09:28 +0800</pubDate><description><![CDATA[​ 有一天路飞突发奇想，他有一个猜想，任意一个大于 2的偶数好像总能写成 2个质数的和。路飞查了资料，发现这个猜想很早就被一个叫哥德巴赫的人提出来了，称为哥德巴赫猜想。输出一个整数表示有多少对 (x,y)满足 x+y=n(x≤y)且x,y均为质数。目前还没有证明这个猜想的正确性。路飞告诉你一个整数 n，让你用这个数去验证。输入一个偶数 n(2≤n≤8000000)​ 注意 1不是质数。]]></description><category></category></item><item><title><![CDATA[OJ #202.身高排序]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131082555</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131082555</guid><author>youdu0213</author><pubDate>Wed, 07 Jun 2023 10:30:23 +0800</pubDate><description><![CDATA[OJ #202.身高排序]]></description><category></category></item><item><title><![CDATA[OJ# 220 成绩排序]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131072453</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131072453</guid><author>youdu0213</author><pubDate>Tue, 06 Jun 2023 17:30:29 +0800</pubDate><description><![CDATA[OJ# 220 成绩排序]]></description><category></category></item><item><title><![CDATA[OJ #207. 评奖2]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131068725</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131068725</guid><author>youdu0213</author><pubDate>Tue, 06 Jun 2023 15:26:00 +0800</pubDate><description><![CDATA[OJ #207 评奖2]]></description><category></category></item><item><title><![CDATA[OJ # 215 评奖1]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/131067076</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/131067076</guid><author>youdu0213</author><pubDate>Tue, 06 Jun 2023 14:35:11 +0800</pubDate><description><![CDATA[OJ#215 评奖1]]></description><category></category></item><item><title><![CDATA[OJ #449 杨辉三角]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/130949680</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/130949680</guid><author>youdu0213</author><pubDate>Tue, 30 May 2023 15:32:04 +0800</pubDate><description><![CDATA[OJ #449 杨辉三角]]></description><category></category></item><item><title><![CDATA[OJ #200 数列计算2]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/130949493</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/130949493</guid><author>youdu0213</author><pubDate>Tue, 30 May 2023 15:26:20 +0800</pubDate><description><![CDATA[OJ #200 数列计算2]]></description><category></category></item><item><title><![CDATA[OJ #199 递推函数]]></title><link>https://blog.youkuaiyun.com/youdu0213/article/details/130948949</link><guid>https://blog.youkuaiyun.com/youdu0213/article/details/130948949</guid><author>youdu0213</author><pubDate>Tue, 30 May 2023 15:20:21 +0800</pubDate><description><![CDATA[OJ #199 递推函数]]></description><category></category></item></channel></rss>