<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Posts on Remi's blog</title><link>https://beautifulremi.dpdns.org/post/</link><description>Recent content in Posts on Remi's blog</description><generator>Hugo</generator><language>zh-cn</language><lastBuildDate>Sun, 17 May 2026 09:07:57 +0000</lastBuildDate><atom:link href="https://beautifulremi.dpdns.org/post/index.xml" rel="self" type="application/rss+xml"/><item><title>3660. 跳跃游戏 IX</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3660.-%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F-ix/</link><pubDate>Thu, 07 May 2026 13:52:49 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3660.-%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F-ix/</guid><description>围绕「跳跃游戏 IX」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>Claude Code愚人节居然能养宠物！</title><link>https://beautifulremi.dpdns.org/post/%E6%97%A5%E5%B8%B8%E8%AE%B0%E5%BD%95/claude-code%E6%84%9A%E4%BA%BA%E8%8A%82%E5%B1%85%E7%84%B6%E8%83%BD%E5%85%BB%E5%AE%A0%E7%89%A9/</link><pubDate>Thu, 02 Apr 2026 17:00:41 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E6%97%A5%E5%B8%B8%E8%AE%B0%E5%BD%95/claude-code%E6%84%9A%E4%BA%BA%E8%8A%82%E5%B1%85%E7%84%B6%E8%83%BD%E5%85%BB%E5%AE%A0%E7%89%A9/</guid><description>So Cute!</description></item><item><title>记录Claude Code的开通会员和封号测试（持续更新）</title><link>https://beautifulremi.dpdns.org/post/%E6%97%A5%E5%B8%B8%E8%AE%B0%E5%BD%95/%E8%AE%B0%E5%BD%95claude-code%E7%9A%84%E5%BC%80%E9%80%9A%E4%BC%9A%E5%91%98%E5%92%8C%E5%B0%81%E5%8F%B7%E6%B5%8B%E8%AF%95%E6%8C%81%E7%BB%AD%E6%9B%B4%E6%96%B0/</link><pubDate>Thu, 02 Apr 2026 16:45:14 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E6%97%A5%E5%B8%B8%E8%AE%B0%E5%BD%95/%E8%AE%B0%E5%BD%95claude-code%E7%9A%84%E5%BC%80%E9%80%9A%E4%BC%9A%E5%91%98%E5%92%8C%E5%B0%81%E5%8F%B7%E6%B5%8B%E8%AF%95%E6%8C%81%E7%BB%AD%E6%9B%B4%E6%96%B0/</guid><description>A\可能会倒闭，但绝不会变质（指封号）</description></item><item><title>3548. 等和矩阵分割 II</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3548.-%E7%AD%89%E5%92%8C%E7%9F%A9%E9%98%B5%E5%88%86%E5%89%B2-ii/</link><pubDate>Thu, 26 Mar 2026 11:19:53 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3548.-%E7%AD%89%E5%92%8C%E7%9F%A9%E9%98%B5%E5%88%86%E5%89%B2-ii/</guid><description>围绕「等和矩阵分割 II」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3546. 等和矩阵分割 I</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3546.-%E7%AD%89%E5%92%8C%E7%9F%A9%E9%98%B5%E5%88%86%E5%89%B2-i/</link><pubDate>Wed, 25 Mar 2026 19:46:48 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3546.-%E7%AD%89%E5%92%8C%E7%9F%A9%E9%98%B5%E5%88%86%E5%89%B2-i/</guid><description>围绕「等和矩阵分割 I」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>Solana - 1</title><link>https://beautifulremi.dpdns.org/post/web3/solana/solana---1/</link><pubDate>Tue, 24 Mar 2026 16:15:35 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/solana/solana---1/</guid><description>学习Solana中&amp;hellip;</description></item><item><title>2906. 构造乘积矩阵</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2906.-%E6%9E%84%E9%80%A0%E4%B9%98%E7%A7%AF%E7%9F%A9%E9%98%B5/</link><pubDate>Tue, 24 Mar 2026 14:06:16 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2906.-%E6%9E%84%E9%80%A0%E4%B9%98%E7%A7%AF%E7%9F%A9%E9%98%B5/</guid><description>围绕「转构造乘积矩阵」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1594. 矩阵的最大非负积</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1594.-%E7%9F%A9%E9%98%B5%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%9E%E8%B4%9F%E7%A7%AF/</link><pubDate>Mon, 23 Mar 2026 10:44:11 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1594.-%E7%9F%A9%E9%98%B5%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%9E%E8%B4%9F%E7%A7%AF/</guid><description>围绕「矩阵的最大非负积」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3567. 子矩阵的最小绝对差</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3567.-%E5%AD%90%E7%9F%A9%E9%98%B5%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BB%9D%E5%AF%B9%E5%B7%AE/</link><pubDate>Fri, 20 Mar 2026 15:08:57 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3567.-%E5%AD%90%E7%9F%A9%E9%98%B5%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BB%9D%E5%AF%B9%E5%B7%AE/</guid><description>围绕「子矩阵的最小绝对差」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3070. 元素和小于等于 k 的子矩阵的数目</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3070.-%E5%85%83%E7%B4%A0%E5%92%8C%E5%B0%8F%E4%BA%8E%E7%AD%89%E4%BA%8E-k-%E7%9A%84%E5%AD%90%E7%9F%A9%E9%98%B5%E7%9A%84%E6%95%B0%E7%9B%AE/</link><pubDate>Wed, 18 Mar 2026 11:27:39 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3070.-%E5%85%83%E7%B4%A0%E5%92%8C%E5%B0%8F%E4%BA%8E%E7%AD%89%E4%BA%8E-k-%E7%9A%84%E5%AD%90%E7%9F%A9%E9%98%B5%E7%9A%84%E6%95%B0%E7%9B%AE/</guid><description>围绕「元素和小于等于 k 的子矩阵的数目」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>R2 - Reactive Essentials(WIP)</title><link>https://beautifulremi.dpdns.org/post/web3/reactive/r2---reactive-essentialswip/</link><pubDate>Mon, 16 Mar 2026 22:21:44 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/reactive/r2---reactive-essentialswip/</guid><description>无论是主网还是测试网，最关键的是 System Contract 地址是统一的。</description></item><item><title>记一次对Widevine DRM的视频破解方法 - 以XCREAM为例</title><link>https://beautifulremi.dpdns.org/post/%E6%97%A5%E5%B8%B8%E8%AE%B0%E5%BD%95/%E8%AE%B0%E4%B8%80%E6%AC%A1%E5%AF%B9widevine-drm%E7%9A%84%E8%A7%86%E9%A2%91%E7%A0%B4%E8%A7%A3%E6%96%B9%E6%B3%95---%E4%BB%A5xcream%E4%B8%BA%E4%BE%8B/</link><pubDate>Mon, 16 Mar 2026 03:20:44 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E6%97%A5%E5%B8%B8%E8%AE%B0%E5%BD%95/%E8%AE%B0%E4%B8%80%E6%AC%A1%E5%AF%B9widevine-drm%E7%9A%84%E8%A7%86%E9%A2%91%E7%A0%B4%E8%A7%A3%E6%96%B9%E6%B3%95---%E4%BB%A5xcream%E4%B8%BA%E4%BE%8B/</guid><description>XCREAM一些视频是可以下载的，另一些是只能流媒体观看，而且下载的视频也只能下载三次，所以既有现实需要又可以钻研网络安全，就来看看怎么个事。</description></item><item><title>R1 - Reactive Basic</title><link>https://beautifulremi.dpdns.org/post/web3/reactive/r1---reactive-basic/</link><pubDate>Sat, 14 Mar 2026 23:06:27 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/reactive/r1---reactive-basic/</guid><description>在去中心化世界里，“谁在调用我”至关重要。假设你有一个目标链合约，功能是“发放奖励”。如果这个合约谁都能调用，那黑客分分钟就把钱领光了。</description></item><item><title>1415. 长度为 n 的开心字符串中字典序第 k 小的字符串</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1415.-%E9%95%BF%E5%BA%A6%E4%B8%BA-n-%E7%9A%84%E5%BC%80%E5%BF%83%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E5%AD%97%E5%85%B8%E5%BA%8F%E7%AC%AC-k-%E5%B0%8F%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2/</link><pubDate>Sat, 14 Mar 2026 22:49:28 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1415.-%E9%95%BF%E5%BA%A6%E4%B8%BA-n-%E7%9A%84%E5%BC%80%E5%BF%83%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E5%AD%97%E5%85%B8%E5%BA%8F%E7%AC%AC-k-%E5%B0%8F%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2/</guid><description>围绕「长度为 n 的开心字符串中字典序第 k 小的字符串」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>L2.2 - 部署睿应式合约</title><link>https://beautifulremi.dpdns.org/post/web3/reactive/l2.2---%E9%83%A8%E7%BD%B2%E7%9D%BF%E5%BA%94%E5%BC%8F%E5%90%88%E7%BA%A6/</link><pubDate>Fri, 13 Mar 2026 20:37:40 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/reactive/l2.2---%E9%83%A8%E7%BD%B2%E7%9D%BF%E5%BA%94%E5%BC%8F%E5%90%88%E7%BA%A6/</guid><description>我们设定一个场景：监控器盯着 Uniswap V2 的流动性池，一旦发现价格（储备金比例）跌破了你设定的标准，它就会自动“拍马赶到”。</description></item><item><title>3296. 移山所需的最少秒数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3296.-%E7%A7%BB%E5%B1%B1%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E7%A7%92%E6%95%B0/</link><pubDate>Fri, 13 Mar 2026 17:29:28 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3296.-%E7%A7%BB%E5%B1%B1%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E7%A7%92%E6%95%B0/</guid><description>围绕「移山所需的最少秒数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>L2.1 - Uniswap V2</title><link>https://beautifulremi.dpdns.org/post/web3/reactive/l2.1---uniswap-v2/</link><pubDate>Thu, 12 Mar 2026 23:14:57 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/reactive/l2.1---uniswap-v2/</guid><description>在传统的交易所（如纳斯达克或币安），交易是靠“订单簿”完成的：有人想买，有人想卖，价格匹配才能成交。</description></item><item><title>L1.5 - 预言机</title><link>https://beautifulremi.dpdns.org/post/web3/reactive/l1.5---%E9%A2%84%E8%A8%80%E6%9C%BA/</link><pubDate>Wed, 11 Mar 2026 22:53:10 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/reactive/l1.5---%E9%A2%84%E8%A8%80%E6%9C%BA/</guid><description>区块链和智能合约是一个完全封闭且自洽的系统。为了保证网络中每个节点运行代码的结果都完全一致（可验证、可重复），智能合约无法主动连接互联网去获取外部信息。</description></item><item><title>1009. 十进制整数的反码</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1009.-%E5%8D%81%E8%BF%9B%E5%88%B6%E6%95%B4%E6%95%B0%E7%9A%84%E5%8F%8D%E7%A0%81/</link><pubDate>Wed, 11 Mar 2026 19:44:52 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1009.-%E5%8D%81%E8%BF%9B%E5%88%B6%E6%95%B4%E6%95%B0%E7%9A%84%E5%8F%8D%E7%A0%81/</guid><description>围绕「十进制整数的反码」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>L1.4 - 订阅机制</title><link>https://beautifulremi.dpdns.org/post/web3/reactive/l1.4---%E8%AE%A2%E9%98%85%E6%9C%BA%E5%88%B6/</link><pubDate>Tue, 10 Mar 2026 19:57:03 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/reactive/l1.4---%E8%AE%A2%E9%98%85%E6%9C%BA%E5%88%B6/</guid><description>订阅服务接口提供订阅和取消订阅的能力。</description></item><item><title>L1.3 - ReactVM和睿应式网络</title><link>https://beautifulremi.dpdns.org/post/web3/reactive/l1.3---reactvm%E5%92%8C%E7%9D%BF%E5%BA%94%E5%BC%8F%E7%BD%91%E7%BB%9C/</link><pubDate>Tue, 10 Mar 2026 17:35:04 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/reactive/l1.3---reactvm%E5%92%8C%E7%9D%BF%E5%BA%94%E5%BC%8F%E7%BD%91%E7%BB%9C/</guid><description>一个响应式合约虽然只有一套代码，但它会同时运行在两个不同的环境中：Reactive Network (RN) 和 ReactVM。</description></item><item><title>L1.2 - Events and Callbacks</title><link>https://beautifulremi.dpdns.org/post/web3/reactive/l1.2---events-and-callbacks/</link><pubDate>Mon, 09 Mar 2026 20:01:36 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/reactive/l1.2---events-and-callbacks/</guid><description>事件允许智能合约在满足特定条件时，通过记录特定信息来与外部世界进行通信。</description></item><item><title>L1.1 - Reactive Contracts</title><link>https://beautifulremi.dpdns.org/post/web3/reactive/l1.1---reactive-contracts/</link><pubDate>Mon, 09 Mar 2026 19:05:36 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/reactive/l1.1---reactive-contracts/</guid><description>考虑一个场景，在没有控制反转的情况下，如果你想实现自动化（例如：当币价跌到 100 时自动卖出），你必须依赖外部实体。</description></item><item><title>L1 - Introduaction</title><link>https://beautifulremi.dpdns.org/post/web3/reactive/l1---introduaction/</link><pubDate>Mon, 09 Mar 2026 18:41:02 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/reactive/l1---introduaction/</guid><description>睿应式智能合约（RCs） 是一种范式转变。</description></item><item><title>3129. 找出所有稳定的二进制数组 I</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3129.-%E6%89%BE%E5%87%BA%E6%89%80%E6%9C%89%E7%A8%B3%E5%AE%9A%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E7%BB%84-i/</link><pubDate>Mon, 09 Mar 2026 18:15:42 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3129.-%E6%89%BE%E5%87%BA%E6%89%80%E6%9C%89%E7%A8%B3%E5%AE%9A%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E7%BB%84-i/</guid><description>围绕「找出所有稳定的二进制数组 I」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1980. 找出不同的二进制字符串</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1980.-%E6%89%BE%E5%87%BA%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2/</link><pubDate>Sun, 08 Mar 2026 17:32:11 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1980.-%E6%89%BE%E5%87%BA%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2/</guid><description>围绕「找出不同的二进制字符串」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1404. 将二进制表示减到 1 的步骤数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1404.-%E5%B0%86%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA%E5%87%8F%E5%88%B0-1-%E7%9A%84%E6%AD%A5%E9%AA%A4%E6%95%B0/</link><pubDate>Thu, 26 Feb 2026 16:47:21 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1404.-%E5%B0%86%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA%E5%87%8F%E5%88%B0-1-%E7%9A%84%E6%AD%A5%E9%AA%A4%E6%95%B0/</guid><description>围绕「将二进制表示减到 1 的步骤数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1022. 从根到叶的二进制数之和</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1022.-%E4%BB%8E%E6%A0%B9%E5%88%B0%E5%8F%B6%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E4%B9%8B%E5%92%8C/</link><pubDate>Tue, 24 Feb 2026 19:26:36 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1022.-%E4%BB%8E%E6%A0%B9%E5%88%B0%E5%8F%B6%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E4%B9%8B%E5%92%8C/</guid><description>围绕「从根到叶的二进制数之和」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1461. 检查一个字符串是否包含所有长度为 K 的二进制子串</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1461.-%E6%A3%80%E6%9F%A5%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89%E9%95%BF%E5%BA%A6%E4%B8%BA-k-%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%90%E4%B8%B2/</link><pubDate>Mon, 23 Feb 2026 18:58:38 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1461.-%E6%A3%80%E6%9F%A5%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89%E9%95%BF%E5%BA%A6%E4%B8%BA-k-%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%90%E4%B8%B2/</guid><description>围绕「检查一个字符串是否包含所有长度为 K 的二进制子串」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>762. 二进制表示中质数个计算置位</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/762.-%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA%E4%B8%AD%E8%B4%A8%E6%95%B0%E4%B8%AA%E8%AE%A1%E7%AE%97%E7%BD%AE%E4%BD%8D/</link><pubDate>Sat, 21 Feb 2026 21:02:00 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/762.-%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA%E4%B8%AD%E8%B4%A8%E6%95%B0%E4%B8%AA%E8%AE%A1%E7%AE%97%E7%BD%AE%E4%BD%8D/</guid><description>围绕「二进制表示中质数个计算置位」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>696. 计数二进制子串</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/696.-%E8%AE%A1%E6%95%B0%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%90%E4%B8%B2/</link><pubDate>Thu, 19 Feb 2026 20:14:46 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/696.-%E8%AE%A1%E6%95%B0%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%90%E4%B8%B2/</guid><description>围绕「计数二进制子串」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>693. 交替位二进制数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/693.-%E4%BA%A4%E6%9B%BF%E4%BD%8D%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0/</link><pubDate>Wed, 18 Feb 2026 23:00:18 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/693.-%E4%BA%A4%E6%9B%BF%E4%BD%8D%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0/</guid><description>围绕「交替位二进制数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>401. 二进制手表</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/401.-%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%89%8B%E8%A1%A8/</link><pubDate>Tue, 17 Feb 2026 18:34:58 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/401.-%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%89%8B%E8%A1%A8/</guid><description>围绕「二进制手表」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>67. 二进制求和</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/67.-%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%B1%82%E5%92%8C/</link><pubDate>Sun, 15 Feb 2026 23:37:26 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/67.-%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%B1%82%E5%92%8C/</guid><description>围绕「二进制求和」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>799. 香槟塔</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/799.-%E9%A6%99%E6%A7%9F%E5%A1%94/</link><pubDate>Sat, 14 Feb 2026 20:01:40 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/799.-%E9%A6%99%E6%A7%9F%E5%A1%94/</guid><description>围绕「香槟塔」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3714. 最长的平衡子串 II</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3714.-%E6%9C%80%E9%95%BF%E7%9A%84%E5%B9%B3%E8%A1%A1%E5%AD%90%E4%B8%B2-ii/</link><pubDate>Fri, 13 Feb 2026 23:00:20 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3714.-%E6%9C%80%E9%95%BF%E7%9A%84%E5%B9%B3%E8%A1%A1%E5%AD%90%E4%B8%B2-ii/</guid><description>围绕「最长的平衡子串 II」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3719. 最长平衡子数组 I</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3719.-%E6%9C%80%E9%95%BF%E5%B9%B3%E8%A1%A1%E5%AD%90%E6%95%B0%E7%BB%84-i/</link><pubDate>Tue, 10 Feb 2026 15:58:28 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3719.-%E6%9C%80%E9%95%BF%E5%B9%B3%E8%A1%A1%E5%AD%90%E6%95%B0%E7%BB%84-i/</guid><description>围绕「最长平衡子数组 I」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1382. 将二叉搜索树变平衡</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1382.-%E5%B0%86%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%8F%98%E5%B9%B3%E8%A1%A1/</link><pubDate>Mon, 09 Feb 2026 10:09:02 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1382.-%E5%B0%86%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%8F%98%E5%B9%B3%E8%A1%A1/</guid><description>围绕「将二叉搜索树变平衡」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1653. 使字符串平衡的最少删除次数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1653.-%E4%BD%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%B9%B3%E8%A1%A1%E7%9A%84%E6%9C%80%E5%B0%91%E5%88%A0%E9%99%A4%E6%AC%A1%E6%95%B0/</link><pubDate>Sat, 07 Feb 2026 20:40:12 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1653.-%E4%BD%BF%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%B9%B3%E8%A1%A1%E7%9A%84%E6%9C%80%E5%B0%91%E5%88%A0%E9%99%A4%E6%AC%A1%E6%95%B0/</guid><description>围绕「使字符串平衡的最少删除次数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3634. 使数组平衡的最少移除数目</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3634.-%E4%BD%BF%E6%95%B0%E7%BB%84%E5%B9%B3%E8%A1%A1%E7%9A%84%E6%9C%80%E5%B0%91%E7%A7%BB%E9%99%A4%E6%95%B0%E7%9B%AE/</link><pubDate>Fri, 06 Feb 2026 21:06:20 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3634.-%E4%BD%BF%E6%95%B0%E7%BB%84%E5%B9%B3%E8%A1%A1%E7%9A%84%E6%9C%80%E5%B0%91%E7%A7%BB%E9%99%A4%E6%95%B0%E7%9B%AE/</guid><description>围绕「使数组平衡的最少移除数目」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3379. 转换数组</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3379.-%E8%BD%AC%E6%8D%A2%E6%95%B0%E7%BB%84/</link><pubDate>Thu, 05 Feb 2026 22:28:32 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3379.-%E8%BD%AC%E6%8D%A2%E6%95%B0%E7%BB%84/</guid><description>围绕「转换数组」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3637. 三段式数组 I</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3637.-%E4%B8%89%E6%AE%B5%E5%BC%8F%E6%95%B0%E7%BB%84-i/</link><pubDate>Tue, 03 Feb 2026 21:23:59 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3637.-%E4%B8%89%E6%AE%B5%E5%BC%8F%E6%95%B0%E7%BB%84-i/</guid><description>围绕「三段式数组 I」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3010. 将数组分成最小总代价的子数组 I</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3010.-%E5%B0%86%E6%95%B0%E7%BB%84%E5%88%86%E6%88%90%E6%9C%80%E5%B0%8F%E6%80%BB%E4%BB%A3%E4%BB%B7%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84-i/</link><pubDate>Sun, 01 Feb 2026 22:42:44 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3010.-%E5%B0%86%E6%95%B0%E7%BB%84%E5%88%86%E6%88%90%E6%9C%80%E5%B0%8F%E6%80%BB%E4%BB%A3%E4%BB%B7%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84-i/</guid><description>围绕「将数组分成最小总代价的子数组 I」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2977. 转换字符串的最小成本 II</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2977.-%E8%BD%AC%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC-ii/</link><pubDate>Fri, 30 Jan 2026 15:13:04 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2977.-%E8%BD%AC%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC-ii/</guid><description>围绕「转换字符串的最小成本 II」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2976. 转换字符串的最小成本 I</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2976.-%E8%BD%AC%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC-i/</link><pubDate>Thu, 29 Jan 2026 15:49:31 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2976.-%E8%BD%AC%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%B0%8F%E6%88%90%E6%9C%AC-i/</guid><description>围绕「转换字符串的最小成本 I」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3650. 边反转的最小路径总成本</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3650.-%E8%BE%B9%E5%8F%8D%E8%BD%AC%E7%9A%84%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E6%80%BB%E6%88%90%E6%9C%AC/</link><pubDate>Tue, 27 Jan 2026 15:06:13 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3650.-%E8%BE%B9%E5%8F%8D%E8%BD%AC%E7%9A%84%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E6%80%BB%E6%88%90%E6%9C%AC/</guid><description>围绕「边反转的最小路径总成本」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1200. 最小绝对差</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1200.-%E6%9C%80%E5%B0%8F%E7%BB%9D%E5%AF%B9%E5%B7%AE/</link><pubDate>Mon, 26 Jan 2026 17:46:49 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1200.-%E6%9C%80%E5%B0%8F%E7%BB%9D%E5%AF%B9%E5%B7%AE/</guid><description>围绕「最小绝对差」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1984. 学生分数的最小差值</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1984.-%E5%AD%A6%E7%94%9F%E5%88%86%E6%95%B0%E7%9A%84%E6%9C%80%E5%B0%8F%E5%B7%AE%E5%80%BC/</link><pubDate>Sun, 25 Jan 2026 15:08:57 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1984.-%E5%AD%A6%E7%94%9F%E5%88%86%E6%95%B0%E7%9A%84%E6%9C%80%E5%B0%8F%E5%B7%AE%E5%80%BC/</guid><description>围绕「学生分数的最小差值」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1877. 数组中最大数对和的最小值</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1877.-%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9C%80%E5%A4%A7%E6%95%B0%E5%AF%B9%E5%92%8C%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC/</link><pubDate>Sat, 24 Jan 2026 17:55:26 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1877.-%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9C%80%E5%A4%A7%E6%95%B0%E5%AF%B9%E5%92%8C%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC/</guid><description>围绕「数组中最大数对和的最小值」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3507 and 3510. 移除最小数对使数组有序</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3507-and-3510.-%E7%A7%BB%E9%99%A4%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AF%B9%E4%BD%BF%E6%95%B0%E7%BB%84%E6%9C%89%E5%BA%8F/</link><pubDate>Thu, 22 Jan 2026 16:30:38 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3507-and-3510.-%E7%A7%BB%E9%99%A4%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AF%B9%E4%BD%BF%E6%95%B0%E7%BB%84%E6%9C%89%E5%BA%8F/</guid><description>围绕「and 3510. 移除最小数对使数组有序」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3314. 构造最小位运算数组 I</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3314.-%E6%9E%84%E9%80%A0%E6%9C%80%E5%B0%8F%E4%BD%8D%E8%BF%90%E7%AE%97%E6%95%B0%E7%BB%84-i/</link><pubDate>Tue, 20 Jan 2026 10:49:47 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3314.-%E6%9E%84%E9%80%A0%E6%9C%80%E5%B0%8F%E4%BD%8D%E8%BF%90%E7%AE%97%E6%95%B0%E7%BB%84-i/</guid><description>围绕「构造最小位运算数组 I」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1292. 元素和小于等于阈值的正方形的最大边长</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1292.-%E5%85%83%E7%B4%A0%E5%92%8C%E5%B0%8F%E4%BA%8E%E7%AD%89%E4%BA%8E%E9%98%88%E5%80%BC%E7%9A%84%E6%AD%A3%E6%96%B9%E5%BD%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E8%BE%B9%E9%95%BF/</link><pubDate>Mon, 19 Jan 2026 14:53:11 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1292.-%E5%85%83%E7%B4%A0%E5%92%8C%E5%B0%8F%E4%BA%8E%E7%AD%89%E4%BA%8E%E9%98%88%E5%80%BC%E7%9A%84%E6%AD%A3%E6%96%B9%E5%BD%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E8%BE%B9%E9%95%BF/</guid><description>围绕「元素和小于等于阈值的正方形的最大边长」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1895. 最大的幻方</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1895.-%E6%9C%80%E5%A4%A7%E7%9A%84%E5%B9%BB%E6%96%B9/</link><pubDate>Sun, 18 Jan 2026 21:17:28 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1895.-%E6%9C%80%E5%A4%A7%E7%9A%84%E5%B9%BB%E6%96%B9/</guid><description>围绕「最大的幻方」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3453. 分割正方形 I</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3453.-%E5%88%86%E5%89%B2%E6%AD%A3%E6%96%B9%E5%BD%A2-i/</link><pubDate>Tue, 13 Jan 2026 20:49:49 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3453.-%E5%88%86%E5%89%B2%E6%AD%A3%E6%96%B9%E5%BD%A2-i/</guid><description>围绕「分割正方形 I」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>85. 最大矩形</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/85.-%E6%9C%80%E5%A4%A7%E7%9F%A9%E5%BD%A2/</link><pubDate>Sun, 11 Jan 2026 21:41:04 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/85.-%E6%9C%80%E5%A4%A7%E7%9F%A9%E5%BD%A2/</guid><description>围绕「最大矩形」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>865. 具有所有最深节点的最小子树</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/865.-%E5%85%B7%E6%9C%89%E6%89%80%E6%9C%89%E6%9C%80%E6%B7%B1%E8%8A%82%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%90%E6%A0%91/</link><pubDate>Fri, 09 Jan 2026 19:59:09 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/865.-%E5%85%B7%E6%9C%89%E6%89%80%E6%9C%89%E6%9C%80%E6%B7%B1%E8%8A%82%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%90%E6%A0%91/</guid><description>围绕「具有所有最深节点的最小子树」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1339. 分裂二叉树的最大乘积</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1339.-%E5%88%86%E8%A3%82%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B9%98%E7%A7%AF/</link><pubDate>Wed, 07 Jan 2026 14:07:10 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1339.-%E5%88%86%E8%A3%82%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B9%98%E7%A7%AF/</guid><description>围绕「分裂二叉树的最大乘积」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1161. 最大层内元素和</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1161.-%E6%9C%80%E5%A4%A7%E5%B1%82%E5%86%85%E5%85%83%E7%B4%A0%E5%92%8C/</link><pubDate>Tue, 06 Jan 2026 19:34:12 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1161.-%E6%9C%80%E5%A4%A7%E5%B1%82%E5%86%85%E5%85%83%E7%B4%A0%E5%92%8C/</guid><description>围绕「最大层内元素和」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1975. 最大方阵和</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1975.-%E6%9C%80%E5%A4%A7%E6%96%B9%E9%98%B5%E5%92%8C/</link><pubDate>Mon, 05 Jan 2026 15:52:36 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1975.-%E6%9C%80%E5%A4%A7%E6%96%B9%E9%98%B5%E5%92%8C/</guid><description>围绕「最大方阵和」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1390. 四因数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1390.-%E5%9B%9B%E5%9B%A0%E6%95%B0/</link><pubDate>Sun, 04 Jan 2026 20:47:09 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1390.-%E5%9B%9B%E5%9B%A0%E6%95%B0/</guid><description>围绕「四因数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1411. 给 N x 3 网格图涂色的方案数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1411.-%E7%BB%99-n-x-3-%E7%BD%91%E6%A0%BC%E5%9B%BE%E6%B6%82%E8%89%B2%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0/</link><pubDate>Sat, 03 Jan 2026 13:52:16 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1411.-%E7%BB%99-n-x-3-%E7%BD%91%E6%A0%BC%E5%9B%BE%E6%B6%82%E8%89%B2%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0/</guid><description>围绕「给 N x 3 网格图涂色的方案数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>961. 在长度 2N 的数组中找出重复 N 次的元素</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/961.-%E5%9C%A8%E9%95%BF%E5%BA%A6-2n-%E7%9A%84%E6%95%B0%E7%BB%84%E4%B8%AD%E6%89%BE%E5%87%BA%E9%87%8D%E5%A4%8D-n-%E6%AC%A1%E7%9A%84%E5%85%83%E7%B4%A0/</link><pubDate>Fri, 02 Jan 2026 14:19:05 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/961.-%E5%9C%A8%E9%95%BF%E5%BA%A6-2n-%E7%9A%84%E6%95%B0%E7%BB%84%E4%B8%AD%E6%89%BE%E5%87%BA%E9%87%8D%E5%A4%8D-n-%E6%AC%A1%E7%9A%84%E5%85%83%E7%B4%A0/</guid><description>围绕「在长度 2N 的数组中找出重复 N 次的元素」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>66. 加一</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/66.-%E5%8A%A0%E4%B8%80/</link><pubDate>Thu, 01 Jan 2026 11:52:17 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/66.-%E5%8A%A0%E4%B8%80/</guid><description>围绕「加一」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>840. 矩阵中的幻方</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/840.-%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E5%B9%BB%E6%96%B9/</link><pubDate>Wed, 31 Dec 2025 19:08:40 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/840.-%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E5%B9%BB%E6%96%B9/</guid><description>围绕「矩阵中的幻方」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3074. 重新分装苹果</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3074.-%E9%87%8D%E6%96%B0%E5%88%86%E8%A3%85%E8%8B%B9%E6%9E%9C/</link><pubDate>Wed, 24 Dec 2025 19:44:07 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3074.-%E9%87%8D%E6%96%B0%E5%88%86%E8%A3%85%E8%8B%B9%E6%9E%9C/</guid><description>围绕「重新分装苹果」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2110. 股票平滑下跌阶段的数目</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2110.-%E8%82%A1%E7%A5%A8%E5%B9%B3%E6%BB%91%E4%B8%8B%E8%B7%8C%E9%98%B6%E6%AE%B5%E7%9A%84%E6%95%B0%E7%9B%AE/</link><pubDate>Mon, 15 Dec 2025 09:35:43 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2110.-%E8%82%A1%E7%A5%A8%E5%B9%B3%E6%BB%91%E4%B8%8B%E8%B7%8C%E9%98%B6%E6%AE%B5%E7%9A%84%E6%95%B0%E7%9B%AE/</guid><description>围绕「股票平滑下跌阶段的数目」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2147. 分隔长廊的方案数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2147.-%E5%88%86%E9%9A%94%E9%95%BF%E5%BB%8A%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0/</link><pubDate>Sun, 14 Dec 2025 20:41:30 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2147.-%E5%88%86%E9%9A%94%E9%95%BF%E5%BB%8A%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0/</guid><description>围绕「分隔长廊的方案数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3531. 统计被覆盖的建筑</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3531.-%E7%BB%9F%E8%AE%A1%E8%A2%AB%E8%A6%86%E7%9B%96%E7%9A%84%E5%BB%BA%E7%AD%91/</link><pubDate>Thu, 11 Dec 2025 18:36:43 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3531.-%E7%BB%9F%E8%AE%A1%E8%A2%AB%E8%A6%86%E7%9B%96%E7%9A%84%E5%BB%BA%E7%AD%91/</guid><description>围绕「统计被覆盖的建筑」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3577. 统计计算机解锁顺序排列数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3577.-%E7%BB%9F%E8%AE%A1%E8%AE%A1%E7%AE%97%E6%9C%BA%E8%A7%A3%E9%94%81%E9%A1%BA%E5%BA%8F%E6%8E%92%E5%88%97%E6%95%B0/</link><pubDate>Thu, 11 Dec 2025 00:06:16 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3577.-%E7%BB%9F%E8%AE%A1%E8%AE%A1%E7%AE%97%E6%9C%BA%E8%A7%A3%E9%94%81%E9%A1%BA%E5%BA%8F%E6%8E%92%E5%88%97%E6%95%B0/</guid><description>围绕「统计计算机解锁顺序排列数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3583. 统计特殊三元组</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3583.-%E7%BB%9F%E8%AE%A1%E7%89%B9%E6%AE%8A%E4%B8%89%E5%85%83%E7%BB%84/</link><pubDate>Tue, 09 Dec 2025 19:30:28 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3583.-%E7%BB%9F%E8%AE%A1%E7%89%B9%E6%AE%8A%E4%B8%89%E5%85%83%E7%BB%84/</guid><description>围绕「统计特殊三元组」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2211. 统计道路上的碰撞次数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2211.-%E7%BB%9F%E8%AE%A1%E9%81%93%E8%B7%AF%E4%B8%8A%E7%9A%84%E7%A2%B0%E6%92%9E%E6%AC%A1%E6%95%B0/</link><pubDate>Thu, 04 Dec 2025 22:31:15 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2211.-%E7%BB%9F%E8%AE%A1%E9%81%93%E8%B7%AF%E4%B8%8A%E7%9A%84%E7%A2%B0%E6%92%9E%E6%AC%A1%E6%95%B0/</guid><description>围绕「统计道路上的碰撞次数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3625. 统计梯形的数目 II</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3625.-%E7%BB%9F%E8%AE%A1%E6%A2%AF%E5%BD%A2%E7%9A%84%E6%95%B0%E7%9B%AE-ii/</link><pubDate>Wed, 03 Dec 2025 20:11:35 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3625.-%E7%BB%9F%E8%AE%A1%E6%A2%AF%E5%BD%A2%E7%9A%84%E6%95%B0%E7%9B%AE-ii/</guid><description>围绕「统计梯形的数目 II」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2141. 同时运行 N 台电脑的最长时间</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2141.-%E5%90%8C%E6%97%B6%E8%BF%90%E8%A1%8C-n-%E5%8F%B0%E7%94%B5%E8%84%91%E7%9A%84%E6%9C%80%E9%95%BF%E6%97%B6%E9%97%B4/</link><pubDate>Mon, 01 Dec 2025 18:59:23 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2141.-%E5%90%8C%E6%97%B6%E8%BF%90%E8%A1%8C-n-%E5%8F%B0%E7%94%B5%E8%84%91%E7%9A%84%E6%9C%80%E9%95%BF%E6%97%B6%E9%97%B4/</guid><description>围绕「同时运行 N 台电脑的最长时间」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1590. 使数组和能被 P 整除</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1590.-%E4%BD%BF%E6%95%B0%E7%BB%84%E5%92%8C%E8%83%BD%E8%A2%AB-p-%E6%95%B4%E9%99%A4/</link><pubDate>Sun, 30 Nov 2025 16:20:36 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1590.-%E4%BD%BF%E6%95%B0%E7%BB%84%E5%92%8C%E8%83%BD%E8%A2%AB-p-%E6%95%B4%E9%99%A4/</guid><description>围绕「使数组和能被 P 整除」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2872. 可以被 K 整除连通块的最大数目</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2872.-%E5%8F%AF%E4%BB%A5%E8%A2%AB-k-%E6%95%B4%E9%99%A4%E8%BF%9E%E9%80%9A%E5%9D%97%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE/</link><pubDate>Fri, 28 Nov 2025 21:04:47 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2872.-%E5%8F%AF%E4%BB%A5%E8%A2%AB-k-%E6%95%B4%E9%99%A4%E8%BF%9E%E9%80%9A%E5%9D%97%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E7%9B%AE/</guid><description>围绕「可以被 K 整除连通块的最大数目」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3381. 长度可被 K 整除的子数组的最大元素和</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3381.-%E9%95%BF%E5%BA%A6%E5%8F%AF%E8%A2%AB-k-%E6%95%B4%E9%99%A4%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0%E5%92%8C/</link><pubDate>Thu, 27 Nov 2025 18:17:24 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3381.-%E9%95%BF%E5%BA%A6%E5%8F%AF%E8%A2%AB-k-%E6%95%B4%E9%99%A4%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0%E5%92%8C/</guid><description>围绕「长度可被 K 整除的子数组的最大元素和」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2435. 矩阵中和能被 K 整除的路径</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2435.-%E7%9F%A9%E9%98%B5%E4%B8%AD%E5%92%8C%E8%83%BD%E8%A2%AB-k-%E6%95%B4%E9%99%A4%E7%9A%84%E8%B7%AF%E5%BE%84/</link><pubDate>Wed, 26 Nov 2025 10:39:33 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2435.-%E7%9F%A9%E9%98%B5%E4%B8%AD%E5%92%8C%E8%83%BD%E8%A2%AB-k-%E6%95%B4%E9%99%A4%E7%9A%84%E8%B7%AF%E5%BE%84/</guid><description>围绕「矩阵中和能被 K 整除的路径」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1262. 可被三整除的最大和</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1262.-%E5%8F%AF%E8%A2%AB%E4%B8%89%E6%95%B4%E9%99%A4%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C/</link><pubDate>Sun, 23 Nov 2025 20:52:52 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1262.-%E5%8F%AF%E8%A2%AB%E4%B8%89%E6%95%B4%E9%99%A4%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C/</guid><description>围绕「可被三整除的最大和」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1930. 长度为 3 的不同回文子序列</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1930.-%E9%95%BF%E5%BA%A6%E4%B8%BA-3-%E7%9A%84%E4%B8%8D%E5%90%8C%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97/</link><pubDate>Fri, 21 Nov 2025 12:08:04 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1930.-%E9%95%BF%E5%BA%A6%E4%B8%BA-3-%E7%9A%84%E4%B8%8D%E5%90%8C%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97/</guid><description>围绕「长度为 3 的不同回文子序列」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1513. 仅含 1 的子串数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1513.-%E4%BB%85%E5%90%AB-1-%E7%9A%84%E5%AD%90%E4%B8%B2%E6%95%B0/</link><pubDate>Sun, 16 Nov 2025 18:05:11 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1513.-%E4%BB%85%E5%90%AB-1-%E7%9A%84%E5%AD%90%E4%B8%B2%E6%95%B0/</guid><description>围绕「仅含 1 的子串数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2536. 子矩阵元素加 1</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2536.-%E5%AD%90%E7%9F%A9%E9%98%B5%E5%85%83%E7%B4%A0%E5%8A%A0-1/</link><pubDate>Fri, 14 Nov 2025 10:45:50 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2536.-%E5%AD%90%E7%9F%A9%E9%98%B5%E5%85%83%E7%B4%A0%E5%8A%A0-1/</guid><description>围绕「子矩阵元素加 1」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3228. 将 1 移动到末尾的最大操作次数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3228.-%E5%B0%86-1-%E7%A7%BB%E5%8A%A8%E5%88%B0%E6%9C%AB%E5%B0%BE%E7%9A%84%E6%9C%80%E5%A4%A7%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/</link><pubDate>Thu, 13 Nov 2025 17:09:07 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3228.-%E5%B0%86-1-%E7%A7%BB%E5%8A%A8%E5%88%B0%E6%9C%AB%E5%B0%BE%E7%9A%84%E6%9C%80%E5%A4%A7%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/</guid><description>围绕「将 1 移动到末尾的最大操作次数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2654. 使数组所有元素变成 1 的最少操作次数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2654.-%E4%BD%BF%E6%95%B0%E7%BB%84%E6%89%80%E6%9C%89%E5%85%83%E7%B4%A0%E5%8F%98%E6%88%90-1-%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/</link><pubDate>Wed, 12 Nov 2025 19:19:45 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2654.-%E4%BD%BF%E6%95%B0%E7%BB%84%E6%89%80%E6%9C%89%E5%85%83%E7%B4%A0%E5%8F%98%E6%88%90-1-%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/</guid><description>围绕「使数组所有元素变成 1 的最少操作次数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>474. 一和零</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/474.-%E4%B8%80%E5%92%8C%E9%9B%B6/</link><pubDate>Tue, 11 Nov 2025 14:22:55 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/474.-%E4%B8%80%E5%92%8C%E9%9B%B6/</guid><description>围绕「一和零」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3542. 将所有元素变为 0 的最少操作次数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3542.-%E5%B0%86%E6%89%80%E6%9C%89%E5%85%83%E7%B4%A0%E5%8F%98%E4%B8%BA-0-%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/</link><pubDate>Mon, 10 Nov 2025 17:23:38 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3542.-%E5%B0%86%E6%89%80%E6%9C%89%E5%85%83%E7%B4%A0%E5%8F%98%E4%B8%BA-0-%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/</guid><description>围绕「将所有元素变为 0 的最少操作次数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1611. 使整数变为 0 的最少操作次数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1611.-%E4%BD%BF%E6%95%B4%E6%95%B0%E5%8F%98%E4%B8%BA-0-%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/</link><pubDate>Sat, 08 Nov 2025 18:39:36 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1611.-%E4%BD%BF%E6%95%B4%E6%95%B0%E5%8F%98%E4%B8%BA-0-%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/</guid><description>围绕「使整数变为 0 的最少操作次数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2528. 最大化城市的最小电量</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2528.-%E6%9C%80%E5%A4%A7%E5%8C%96%E5%9F%8E%E5%B8%82%E7%9A%84%E6%9C%80%E5%B0%8F%E7%94%B5%E9%87%8F/</link><pubDate>Fri, 07 Nov 2025 18:21:37 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2528.-%E6%9C%80%E5%A4%A7%E5%8C%96%E5%9F%8E%E5%B8%82%E7%9A%84%E6%9C%80%E5%B0%8F%E7%94%B5%E9%87%8F/</guid><description>围绕「最大化城市的最小电量」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3607. 电网维护</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3607.-%E7%94%B5%E7%BD%91%E7%BB%B4%E6%8A%A4/</link><pubDate>Thu, 06 Nov 2025 17:09:58 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3607.-%E7%94%B5%E7%BD%91%E7%BB%B4%E6%8A%A4/</guid><description>围绕「电网维护」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3318. 计算子数组的 x-sum</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3318.-%E8%AE%A1%E7%AE%97%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84-x-sum/</link><pubDate>Tue, 04 Nov 2025 20:40:34 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3318.-%E8%AE%A1%E7%AE%97%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84-x-sum/</guid><description>围绕「计算子数组的 x-sum」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1578. 使绳子变成彩色的最短时间</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1578.-%E4%BD%BF%E7%BB%B3%E5%AD%90%E5%8F%98%E6%88%90%E5%BD%A9%E8%89%B2%E7%9A%84%E6%9C%80%E7%9F%AD%E6%97%B6%E9%97%B4/</link><pubDate>Mon, 03 Nov 2025 17:54:50 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1578.-%E4%BD%BF%E7%BB%B3%E5%AD%90%E5%8F%98%E6%88%90%E5%BD%A9%E8%89%B2%E7%9A%84%E6%9C%80%E7%9F%AD%E6%97%B6%E9%97%B4/</guid><description>围绕「使绳子变成彩色的最短时间」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2257. 统计网格图中没有被保卫的格子数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2257.-%E7%BB%9F%E8%AE%A1%E7%BD%91%E6%A0%BC%E5%9B%BE%E4%B8%AD%E6%B2%A1%E6%9C%89%E8%A2%AB%E4%BF%9D%E5%8D%AB%E7%9A%84%E6%A0%BC%E5%AD%90%E6%95%B0/</link><pubDate>Sun, 02 Nov 2025 17:37:50 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2257.-%E7%BB%9F%E8%AE%A1%E7%BD%91%E6%A0%BC%E5%9B%BE%E4%B8%AD%E6%B2%A1%E6%9C%89%E8%A2%AB%E4%BF%9D%E5%8D%AB%E7%9A%84%E6%A0%BC%E5%AD%90%E6%95%B0/</guid><description>围绕「统计网格图中没有被保卫的格子数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3217. 从链表中移除在数组中存在的节点</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3217.-%E4%BB%8E%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%A7%BB%E9%99%A4%E5%9C%A8%E6%95%B0%E7%BB%84%E4%B8%AD%E5%AD%98%E5%9C%A8%E7%9A%84%E8%8A%82%E7%82%B9/</link><pubDate>Sat, 01 Nov 2025 14:45:36 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3217.-%E4%BB%8E%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%A7%BB%E9%99%A4%E5%9C%A8%E6%95%B0%E7%BB%84%E4%B8%AD%E5%AD%98%E5%9C%A8%E7%9A%84%E8%8A%82%E7%82%B9/</guid><description>围绕「从链表中移除在数组中存在的节点」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1526. 形成目标数组的子数组最少增加次数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1526.-%E5%BD%A2%E6%88%90%E7%9B%AE%E6%A0%87%E6%95%B0%E7%BB%84%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%9C%80%E5%B0%91%E5%A2%9E%E5%8A%A0%E6%AC%A1%E6%95%B0/</link><pubDate>Thu, 30 Oct 2025 10:12:43 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1526.-%E5%BD%A2%E6%88%90%E7%9B%AE%E6%A0%87%E6%95%B0%E7%BB%84%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%9C%80%E5%B0%91%E5%A2%9E%E5%8A%A0%E6%AC%A1%E6%95%B0/</guid><description>围绕「形成目标数组的子数组最少增加次数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3354. 使数组元素等于零</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3354.-%E4%BD%BF%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E7%AD%89%E4%BA%8E%E9%9B%B6/</link><pubDate>Wed, 29 Oct 2025 00:50:12 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3354.-%E4%BD%BF%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E7%AD%89%E4%BA%8E%E9%9B%B6/</guid><description>围绕「使数组元素等于零」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2048. 下一个更大的数值平衡数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2048.-%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E7%9A%84%E6%95%B0%E5%80%BC%E5%B9%B3%E8%A1%A1%E6%95%B0/</link><pubDate>Fri, 24 Oct 2025 20:29:29 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2048.-%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E7%9A%84%E6%95%B0%E5%80%BC%E5%B9%B3%E8%A1%A1%E6%95%B0/</guid><description>围绕「下一个更大的数值平衡数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3461. 判断操作后字符串中的数字是否相等 I</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3461.-%E5%88%A4%E6%96%AD%E6%93%8D%E4%BD%9C%E5%90%8E%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%95%B0%E5%AD%97%E6%98%AF%E5%90%A6%E7%9B%B8%E7%AD%89-i/</link><pubDate>Thu, 23 Oct 2025 21:22:52 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3461.-%E5%88%A4%E6%96%AD%E6%93%8D%E4%BD%9C%E5%90%8E%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%95%B0%E5%AD%97%E6%98%AF%E5%90%A6%E7%9B%B8%E7%AD%89-i/</guid><description>围绕「判断操作后字符串中的数字是否相等 I」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3347. 执行操作后元素的最高频率 II</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3347.-%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E9%AB%98%E9%A2%91%E7%8E%87-ii/</link><pubDate>Wed, 22 Oct 2025 17:55:23 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3347.-%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E9%AB%98%E9%A2%91%E7%8E%87-ii/</guid><description>围绕「执行操作后元素的最高频率 II」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3346. 执行操作后元素的最高频率 I</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3346.-%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E9%AB%98%E9%A2%91%E7%8E%87-i/</link><pubDate>Tue, 21 Oct 2025 18:37:12 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3346.-%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E9%AB%98%E9%A2%91%E7%8E%87-i/</guid><description>围绕「执行操作后元素的最高频率 I」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2011. 执行操作后的变量值</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2011.-%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E5%8F%98%E9%87%8F%E5%80%BC/</link><pubDate>Mon, 20 Oct 2025 18:42:48 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2011.-%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E5%8F%98%E9%87%8F%E5%80%BC/</guid><description>围绕「执行操作后的变量值」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1625. 执行操作后字典序最小的字符串</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1625.-%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E5%AD%97%E5%85%B8%E5%BA%8F%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2/</link><pubDate>Sun, 19 Oct 2025 19:57:26 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1625.-%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E5%AD%97%E5%85%B8%E5%BA%8F%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2/</guid><description>围绕「执行操作后字典序最小的字符串」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3397. 执行操作后不同元素的最大数量</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3397.-%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E4%B8%8D%E5%90%8C%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F/</link><pubDate>Sat, 18 Oct 2025 19:02:23 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3397.-%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E4%B8%8D%E5%90%8C%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E5%A4%A7%E6%95%B0%E9%87%8F/</guid><description>围绕「执行操作后不同元素的最大数量」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2598. 执行操作后的最大 MEX</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2598.-%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7-mex/</link><pubDate>Thu, 16 Oct 2025 15:59:39 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2598.-%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7-mex/</guid><description>围绕「执行操作后的最大 MEX」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3350. 检测相邻递增子数组 II</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3350.-%E6%A3%80%E6%B5%8B%E7%9B%B8%E9%82%BB%E9%80%92%E5%A2%9E%E5%AD%90%E6%95%B0%E7%BB%84-ii/</link><pubDate>Wed, 15 Oct 2025 16:48:57 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3350.-%E6%A3%80%E6%B5%8B%E7%9B%B8%E9%82%BB%E9%80%92%E5%A2%9E%E5%AD%90%E6%95%B0%E7%BB%84-ii/</guid><description>围绕「检测相邻递增子数组 II」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3349. 检测相邻递增子数组 I</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3349.-%E6%A3%80%E6%B5%8B%E7%9B%B8%E9%82%BB%E9%80%92%E5%A2%9E%E5%AD%90%E6%95%B0%E7%BB%84-i/</link><pubDate>Tue, 14 Oct 2025 15:43:05 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3349.-%E6%A3%80%E6%B5%8B%E7%9B%B8%E9%82%BB%E9%80%92%E5%A2%9E%E5%AD%90%E6%95%B0%E7%BB%84-i/</guid><description>围绕「检测相邻递增子数组 I」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3539. 魔法序列的数组乘积之和</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3539.-%E9%AD%94%E6%B3%95%E5%BA%8F%E5%88%97%E7%9A%84%E6%95%B0%E7%BB%84%E4%B9%98%E7%A7%AF%E4%B9%8B%E5%92%8C/</link><pubDate>Sun, 12 Oct 2025 17:04:53 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3539.-%E9%AD%94%E6%B3%95%E5%BA%8F%E5%88%97%E7%9A%84%E6%95%B0%E7%BB%84%E4%B9%98%E7%A7%AF%E4%B9%8B%E5%92%8C/</guid><description>围绕「魔法序列的数组乘积之和」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3186. 施咒的最大总伤害</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3186.-%E6%96%BD%E5%92%92%E7%9A%84%E6%9C%80%E5%A4%A7%E6%80%BB%E4%BC%A4%E5%AE%B3/</link><pubDate>Sat, 11 Oct 2025 19:38:33 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3186.-%E6%96%BD%E5%92%92%E7%9A%84%E6%9C%80%E5%A4%A7%E6%80%BB%E4%BC%A4%E5%AE%B3/</guid><description>围绕「施咒的最大总伤害」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3147. 从魔法师身上吸取的最大能量</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3147.-%E4%BB%8E%E9%AD%94%E6%B3%95%E5%B8%88%E8%BA%AB%E4%B8%8A%E5%90%B8%E5%8F%96%E7%9A%84%E6%9C%80%E5%A4%A7%E8%83%BD%E9%87%8F/</link><pubDate>Fri, 10 Oct 2025 21:10:02 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3147.-%E4%BB%8E%E9%AD%94%E6%B3%95%E5%B8%88%E8%BA%AB%E4%B8%8A%E5%90%B8%E5%8F%96%E7%9A%84%E6%9C%80%E5%A4%A7%E8%83%BD%E9%87%8F/</guid><description>围绕「从魔法师身上吸取的最大能量」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3494. 酿造药水需要的最少总时间</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3494.-%E9%85%BF%E9%80%A0%E8%8D%AF%E6%B0%B4%E9%9C%80%E8%A6%81%E7%9A%84%E6%9C%80%E5%B0%91%E6%80%BB%E6%97%B6%E9%97%B4/</link><pubDate>Thu, 09 Oct 2025 18:07:59 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3494.-%E9%85%BF%E9%80%A0%E8%8D%AF%E6%B0%B4%E9%9C%80%E8%A6%81%E7%9A%84%E6%9C%80%E5%B0%91%E6%80%BB%E6%97%B6%E9%97%B4/</guid><description>围绕「酿造药水需要的最少总时间」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2300. 咒语和药水的成功对数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2300.-%E5%92%92%E8%AF%AD%E5%92%8C%E8%8D%AF%E6%B0%B4%E7%9A%84%E6%88%90%E5%8A%9F%E5%AF%B9%E6%95%B0/</link><pubDate>Thu, 09 Oct 2025 00:14:35 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2300.-%E5%92%92%E8%AF%AD%E5%92%8C%E8%8D%AF%E6%B0%B4%E7%9A%84%E6%88%90%E5%8A%9F%E5%AF%B9%E6%95%B0/</guid><description>围绕「咒语和药水的成功对数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1488. 避免洪水泛滥</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1488.-%E9%81%BF%E5%85%8D%E6%B4%AA%E6%B0%B4%E6%B3%9B%E6%BB%A5/</link><pubDate>Tue, 07 Oct 2025 17:34:56 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1488.-%E9%81%BF%E5%85%8D%E6%B4%AA%E6%B0%B4%E6%B3%9B%E6%BB%A5/</guid><description>围绕「避免洪水泛滥」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>778. 水位上升的泳池中游泳</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/778.-%E6%B0%B4%E4%BD%8D%E4%B8%8A%E5%8D%87%E7%9A%84%E6%B3%B3%E6%B1%A0%E4%B8%AD%E6%B8%B8%E6%B3%B3/</link><pubDate>Mon, 06 Oct 2025 20:05:14 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/778.-%E6%B0%B4%E4%BD%8D%E4%B8%8A%E5%8D%87%E7%9A%84%E6%B3%B3%E6%B1%A0%E4%B8%AD%E6%B8%B8%E6%B3%B3/</guid><description>围绕「水位上升的泳池中游泳」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>417. 太平洋大西洋水流问题</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/417.-%E5%A4%AA%E5%B9%B3%E6%B4%8B%E5%A4%A7%E8%A5%BF%E6%B4%8B%E6%B0%B4%E6%B5%81%E9%97%AE%E9%A2%98/</link><pubDate>Sun, 05 Oct 2025 23:11:41 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/417.-%E5%A4%AA%E5%B9%B3%E6%B4%8B%E5%A4%A7%E8%A5%BF%E6%B4%8B%E6%B0%B4%E6%B5%81%E9%97%AE%E9%A2%98/</guid><description>围绕「太平洋大西洋水流问题」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>11. 盛最多水的容器</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/11.-%E7%9B%9B%E6%9C%80%E5%A4%9A%E6%B0%B4%E7%9A%84%E5%AE%B9%E5%99%A8/</link><pubDate>Sat, 04 Oct 2025 23:29:49 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/11.-%E7%9B%9B%E6%9C%80%E5%A4%9A%E6%B0%B4%E7%9A%84%E5%AE%B9%E5%99%A8/</guid><description>围绕「盛最多水的容器」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>Golang - 匿名函数</title><link>https://beautifulremi.dpdns.org/post/golang/golang---%E5%8C%BF%E5%90%8D%E5%87%BD%E6%95%B0/</link><pubDate>Sat, 04 Oct 2025 00:54:18 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/golang/golang---%E5%8C%BF%E5%90%8D%E5%87%BD%E6%95%B0/</guid><description>在 Go 中，匿名函数（Anonymous Function），也称为函数字面量，是指在代码中直接定义的、没有函数名的函数。</description></item><item><title>Golang - 并发</title><link>https://beautifulremi.dpdns.org/post/golang/golang---%E5%B9%B6%E5%8F%91/</link><pubDate>Fri, 03 Oct 2025 20:30:40 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/golang/golang---%E5%B9%B6%E5%8F%91/</guid><description>Goroutine是一个轻量级的独立任务执行单元。</description></item><item><title>Golang - Sort 排序和搜索</title><link>https://beautifulremi.dpdns.org/post/golang/golang---sort-%E6%8E%92%E5%BA%8F%E5%92%8C%E6%90%9C%E7%B4%A2/</link><pubDate>Fri, 03 Oct 2025 14:03:07 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/golang/golang---sort-%E6%8E%92%E5%BA%8F%E5%92%8C%E6%90%9C%E7%B4%A2/</guid><description>Go 的 sort 包设计得非常优雅和灵活，它不仅仅是一个函数，而是一整套工具，其核心是基于一个接口 (sort.Interface) 来实现的。</description></item><item><title>Golang - 堆的实现</title><link>https://beautifulremi.dpdns.org/post/golang/golang---%E5%A0%86%E7%9A%84%E5%AE%9E%E7%8E%B0/</link><pubDate>Fri, 03 Oct 2025 13:32:57 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/golang/golang---%E5%A0%86%E7%9A%84%E5%AE%9E%E7%8E%B0/</guid><description>Go 的标准库 container/heap 定义了一个接口（heap.Interface），我们只需要让自己的数据类型满足这个接口。</description></item><item><title>407. 接雨水 II</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/407.-%E6%8E%A5%E9%9B%A8%E6%B0%B4-ii/</link><pubDate>Fri, 03 Oct 2025 12:10:25 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/407.-%E6%8E%A5%E9%9B%A8%E6%B0%B4-ii/</guid><description>围绕「接雨水 II」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3100. 换水问题 II</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3100.-%E6%8D%A2%E6%B0%B4%E9%97%AE%E9%A2%98-ii/</link><pubDate>Thu, 02 Oct 2025 15:17:45 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3100.-%E6%8D%A2%E6%B0%B4%E9%97%AE%E9%A2%98-ii/</guid><description>围绕「换水问题 II」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1518. 换水问题</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1518.-%E6%8D%A2%E6%B0%B4%E9%97%AE%E9%A2%98/</link><pubDate>Wed, 01 Oct 2025 19:38:51 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1518.-%E6%8D%A2%E6%B0%B4%E9%97%AE%E9%A2%98/</guid><description>围绕「换水问题」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2221. 数组的三角和</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2221.-%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%89%E8%A7%92%E5%92%8C/</link><pubDate>Tue, 30 Sep 2025 12:38:39 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2221.-%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%89%E8%A7%92%E5%92%8C/</guid><description>围绕「数组的三角和」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1039. 多边形三角剖分的最低得分</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1039.-%E5%A4%9A%E8%BE%B9%E5%BD%A2%E4%B8%89%E8%A7%92%E5%89%96%E5%88%86%E7%9A%84%E6%9C%80%E4%BD%8E%E5%BE%97%E5%88%86/</link><pubDate>Mon, 29 Sep 2025 21:24:21 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1039.-%E5%A4%9A%E8%BE%B9%E5%BD%A2%E4%B8%89%E8%A7%92%E5%89%96%E5%88%86%E7%9A%84%E6%9C%80%E4%BD%8E%E5%BE%97%E5%88%86/</guid><description>围绕「多边形三角剖分的最低得分」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>Golang - 泛型</title><link>https://beautifulremi.dpdns.org/post/golang/golang---%E6%B3%9B%E5%9E%8B/</link><pubDate>Mon, 29 Sep 2025 20:09:42 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/golang/golang---%E6%B3%9B%E5%9E%8B/</guid><description>泛型允许你编写不关心具体类型的函数或数据结构。就像C++的模板一样，你可以写一个 Index 函数，它既能在一个 []int 中查找 int。</description></item><item><title>Golang - 方法与接口</title><link>https://beautifulremi.dpdns.org/post/golang/golang---%E6%96%B9%E6%B3%95%E4%B8%8E%E6%8E%A5%E5%8F%A3/</link><pubDate>Mon, 29 Sep 2025 16:44:01 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/golang/golang---%E6%96%B9%E6%B3%95%E4%B8%8E%E6%8E%A5%E5%8F%A3/</guid><description>虽然Go没有 class 关键字，但通过为自定义类型（主要是struct）附加方法，它可以实现与C++类非常相似的功能，只是语法和组织方式不同。</description></item><item><title>Golang - 更多类型</title><link>https://beautifulremi.dpdns.org/post/golang/golang---%E6%9B%B4%E5%A4%9A%E7%B1%BB%E5%9E%8B/</link><pubDate>Mon, 29 Sep 2025 14:31:33 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/golang/golang---%E6%9B%B4%E5%A4%9A%E7%B1%BB%E5%9E%8B/</guid><description>Go语言沿用了C/C++中关于指针的两个核心操作符 &amp;amp; 和 *，它们的含义是完全一样的。</description></item><item><title>Golang - 流程控制语句</title><link>https://beautifulremi.dpdns.org/post/golang/golang---%E6%B5%81%E7%A8%8B%E6%8E%A7%E5%88%B6%E8%AF%AD%E5%8F%A5/</link><pubDate>Mon, 29 Sep 2025 13:54:38 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/golang/golang---%E6%B5%81%E7%A8%8B%E6%8E%A7%E5%88%B6%E8%AF%AD%E5%8F%A5/</guid><description>无圆括号 (): Go的for语句后面不需要用()把三个部分括起来，这让语法更简洁。</description></item><item><title>Golang - 包，变量与函数</title><link>https://beautifulremi.dpdns.org/post/golang/golang---%E5%8C%85%E5%8F%98%E9%87%8F%E4%B8%8E%E5%87%BD%E6%95%B0/</link><pubDate>Mon, 29 Sep 2025 12:57:54 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/golang/golang---%E5%8C%85%E5%8F%98%E9%87%8F%E4%B8%8E%E5%87%BD%E6%95%B0/</guid><description>每个 Go 程序都由包构成。</description></item><item><title>976. 三角形的最大周长</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/976.-%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%91%A8%E9%95%BF/</link><pubDate>Sun, 28 Sep 2025 15:19:31 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/976.-%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%91%A8%E9%95%BF/</guid><description>围绕「三角形的最大周长」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>812. 最大三角形面积</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/812.-%E6%9C%80%E5%A4%A7%E4%B8%89%E8%A7%92%E5%BD%A2%E9%9D%A2%E7%A7%AF/</link><pubDate>Sat, 27 Sep 2025 12:39:08 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/812.-%E6%9C%80%E5%A4%A7%E4%B8%89%E8%A7%92%E5%BD%A2%E9%9D%A2%E7%A7%AF/</guid><description>围绕「最大三角形面积」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>611. 有效三角形的个数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/611.-%E6%9C%89%E6%95%88%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E4%B8%AA%E6%95%B0/</link><pubDate>Fri, 26 Sep 2025 12:56:12 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/611.-%E6%9C%89%E6%95%88%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E4%B8%AA%E6%95%B0/</guid><description>围绕「有效三角形的个数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>120. 三角形最小路径和</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/120.-%E4%B8%89%E8%A7%92%E5%BD%A2%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C/</link><pubDate>Thu, 25 Sep 2025 16:00:41 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/120.-%E4%B8%89%E8%A7%92%E5%BD%A2%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C/</guid><description>围绕「三角形最小路径和」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>166. 分数到小数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/166.-%E5%88%86%E6%95%B0%E5%88%B0%E5%B0%8F%E6%95%B0/</link><pubDate>Wed, 24 Sep 2025 12:13:02 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/166.-%E5%88%86%E6%95%B0%E5%88%B0%E5%B0%8F%E6%95%B0/</guid><description>围绕「分数到小数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>165. 比较版本号</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/165.-%E6%AF%94%E8%BE%83%E7%89%88%E6%9C%AC%E5%8F%B7/</link><pubDate>Tue, 23 Sep 2025 17:12:43 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/165.-%E6%AF%94%E8%BE%83%E7%89%88%E6%9C%AC%E5%8F%B7/</guid><description>围绕「比较版本号」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3005. 最大频率元素计数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3005.-%E6%9C%80%E5%A4%A7%E9%A2%91%E7%8E%87%E5%85%83%E7%B4%A0%E8%AE%A1%E6%95%B0/</link><pubDate>Mon, 22 Sep 2025 23:31:16 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3005.-%E6%9C%80%E5%A4%A7%E9%A2%91%E7%8E%87%E5%85%83%E7%B4%A0%E8%AE%A1%E6%95%B0/</guid><description>围绕「最大频率元素计数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1912. 设计电影租借系统</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1912.-%E8%AE%BE%E8%AE%A1%E7%94%B5%E5%BD%B1%E7%A7%9F%E5%80%9F%E7%B3%BB%E7%BB%9F/</link><pubDate>Sun, 21 Sep 2025 12:38:45 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1912.-%E8%AE%BE%E8%AE%A1%E7%94%B5%E5%BD%B1%E7%A7%9F%E5%80%9F%E7%B3%BB%E7%BB%9F/</guid><description>围绕「设计电影租借系统」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3508. 设计路由器</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3508.-%E8%AE%BE%E8%AE%A1%E8%B7%AF%E7%94%B1%E5%99%A8/</link><pubDate>Sun, 21 Sep 2025 12:35:50 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3508.-%E8%AE%BE%E8%AE%A1%E8%B7%AF%E7%94%B1%E5%99%A8/</guid><description>围绕「设计路由器」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3484. 设计电子表格</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3484.-%E8%AE%BE%E8%AE%A1%E7%94%B5%E5%AD%90%E8%A1%A8%E6%A0%BC/</link><pubDate>Fri, 19 Sep 2025 16:19:16 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3484.-%E8%AE%BE%E8%AE%A1%E7%94%B5%E5%AD%90%E8%A1%A8%E6%A0%BC/</guid><description>围绕「设计电子表格」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3408. 设计任务管理器</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3408.-%E8%AE%BE%E8%AE%A1%E4%BB%BB%E5%8A%A1%E7%AE%A1%E7%90%86%E5%99%A8/</link><pubDate>Thu, 18 Sep 2025 23:25:30 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3408.-%E8%AE%BE%E8%AE%A1%E4%BB%BB%E5%8A%A1%E7%AE%A1%E7%90%86%E5%99%A8/</guid><description>围绕「设计任务管理器」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2349. 设计数字容器系统</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2349.-%E8%AE%BE%E8%AE%A1%E6%95%B0%E5%AD%97%E5%AE%B9%E5%99%A8%E7%B3%BB%E7%BB%9F/</link><pubDate>Wed, 17 Sep 2025 14:49:06 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2349.-%E8%AE%BE%E8%AE%A1%E6%95%B0%E5%AD%97%E5%AE%B9%E5%99%A8%E7%B3%BB%E7%BB%9F/</guid><description>围绕「设计数字容器系统」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2197. 替换数组中的非互质数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2197.-%E6%9B%BF%E6%8D%A2%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%9D%9E%E4%BA%92%E8%B4%A8%E6%95%B0/</link><pubDate>Tue, 16 Sep 2025 13:45:27 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2197.-%E6%9B%BF%E6%8D%A2%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%9D%9E%E4%BA%92%E8%B4%A8%E6%95%B0/</guid><description>围绕「替换数组中的非互质数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1935. 可以输入的最大单词数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1935.-%E5%8F%AF%E4%BB%A5%E8%BE%93%E5%85%A5%E7%9A%84%E6%9C%80%E5%A4%A7%E5%8D%95%E8%AF%8D%E6%95%B0/</link><pubDate>Mon, 15 Sep 2025 21:22:27 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1935.-%E5%8F%AF%E4%BB%A5%E8%BE%93%E5%85%A5%E7%9A%84%E6%9C%80%E5%A4%A7%E5%8D%95%E8%AF%8D%E6%95%B0/</guid><description>围绕「可以输入的最大单词数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>966. 元音拼写检查器</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/966.-%E5%85%83%E9%9F%B3%E6%8B%BC%E5%86%99%E6%A3%80%E6%9F%A5%E5%99%A8/</link><pubDate>Sun, 14 Sep 2025 19:12:27 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/966.-%E5%85%83%E9%9F%B3%E6%8B%BC%E5%86%99%E6%A3%80%E6%9F%A5%E5%99%A8/</guid><description>围绕「元音拼写检查器」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3541. 找到频率最高的元音和辅音</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3541.-%E6%89%BE%E5%88%B0%E9%A2%91%E7%8E%87%E6%9C%80%E9%AB%98%E7%9A%84%E5%85%83%E9%9F%B3%E5%92%8C%E8%BE%85%E9%9F%B3/</link><pubDate>Sat, 13 Sep 2025 10:09:50 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3541.-%E6%89%BE%E5%88%B0%E9%A2%91%E7%8E%87%E6%9C%80%E9%AB%98%E7%9A%84%E5%85%83%E9%9F%B3%E5%92%8C%E8%BE%85%E9%9F%B3/</guid><description>围绕「找到频率最高的元音和辅音」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3227. 字符串元音游戏</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3227.-%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%85%83%E9%9F%B3%E6%B8%B8%E6%88%8F/</link><pubDate>Fri, 12 Sep 2025 18:50:37 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3227.-%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%85%83%E9%9F%B3%E6%B8%B8%E6%88%8F/</guid><description>围绕「字符串元音游戏」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2785. 将字符串中的元音字母排序</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2785.-%E5%B0%86%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%85%83%E9%9F%B3%E5%AD%97%E6%AF%8D%E6%8E%92%E5%BA%8F/</link><pubDate>Thu, 11 Sep 2025 17:53:56 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2785.-%E5%B0%86%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%85%83%E9%9F%B3%E5%AD%97%E6%AF%8D%E6%8E%92%E5%BA%8F/</guid><description>围绕「将字符串中的元音字母排序」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1733. 需要教语言的最少人数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1733.-%E9%9C%80%E8%A6%81%E6%95%99%E8%AF%AD%E8%A8%80%E7%9A%84%E6%9C%80%E5%B0%91%E4%BA%BA%E6%95%B0/</link><pubDate>Wed, 10 Sep 2025 21:16:56 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1733.-%E9%9C%80%E8%A6%81%E6%95%99%E8%AF%AD%E8%A8%80%E7%9A%84%E6%9C%80%E5%B0%91%E4%BA%BA%E6%95%B0/</guid><description>围绕「需要教语言的最少人数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2327. 知道秘密的人数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2327.-%E7%9F%A5%E9%81%93%E7%A7%98%E5%AF%86%E7%9A%84%E4%BA%BA%E6%95%B0/</link><pubDate>Tue, 09 Sep 2025 23:44:43 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2327.-%E7%9F%A5%E9%81%93%E7%A7%98%E5%AF%86%E7%9A%84%E4%BA%BA%E6%95%B0/</guid><description>围绕「知道秘密的人数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1317. 将整数转换为两个无零整数的和</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1317.-%E5%B0%86%E6%95%B4%E6%95%B0%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%B8%A4%E4%B8%AA%E6%97%A0%E9%9B%B6%E6%95%B4%E6%95%B0%E7%9A%84%E5%92%8C/</link><pubDate>Mon, 08 Sep 2025 16:56:41 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1317.-%E5%B0%86%E6%95%B4%E6%95%B0%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%B8%A4%E4%B8%AA%E6%97%A0%E9%9B%B6%E6%95%B4%E6%95%B0%E7%9A%84%E5%92%8C/</guid><description>围绕「将整数转换为两个无零整数的和」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1304. 和为零的 N 个不同整数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1304.-%E5%92%8C%E4%B8%BA%E9%9B%B6%E7%9A%84-n-%E4%B8%AA%E4%B8%8D%E5%90%8C%E6%95%B4%E6%95%B0/</link><pubDate>Sun, 07 Sep 2025 15:44:53 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1304.-%E5%92%8C%E4%B8%BA%E9%9B%B6%E7%9A%84-n-%E4%B8%AA%E4%B8%8D%E5%90%8C%E6%95%B4%E6%95%B0/</guid><description>围绕「和为零的 N 个不同整数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3495. 使数组元素都变为零的最少操作次数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3495.-%E4%BD%BF%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E9%83%BD%E5%8F%98%E4%B8%BA%E9%9B%B6%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/</link><pubDate>Sat, 06 Sep 2025 17:50:58 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3495.-%E4%BD%BF%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E9%83%BD%E5%8F%98%E4%B8%BA%E9%9B%B6%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/</guid><description>围绕「使数组元素都变为零的最少操作次数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2749. 得到整数零需要执行的最少操作数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2749.-%E5%BE%97%E5%88%B0%E6%95%B4%E6%95%B0%E9%9B%B6%E9%9C%80%E8%A6%81%E6%89%A7%E8%A1%8C%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%95%B0/</link><pubDate>Fri, 05 Sep 2025 15:27:18 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2749.-%E5%BE%97%E5%88%B0%E6%95%B4%E6%95%B0%E9%9B%B6%E9%9C%80%E8%A6%81%E6%89%A7%E8%A1%8C%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%95%B0/</guid><description>围绕「得到整数零需要执行的最少操作数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3025. 人员站位的方案数 I</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3025.-%E4%BA%BA%E5%91%98%E7%AB%99%E4%BD%8D%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0-i/</link><pubDate>Tue, 02 Sep 2025 23:29:35 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3025.-%E4%BA%BA%E5%91%98%E7%AB%99%E4%BD%8D%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0-i/</guid><description>围绕「人员站位的方案数 I」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1792. 最大平均通过率</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1792.-%E6%9C%80%E5%A4%A7%E5%B9%B3%E5%9D%87%E9%80%9A%E8%BF%87%E7%8E%87/</link><pubDate>Mon, 01 Sep 2025 15:03:30 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1792.-%E6%9C%80%E5%A4%A7%E5%B9%B3%E5%9D%87%E9%80%9A%E8%BF%87%E7%8E%87/</guid><description>围绕「最大平均通过率」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>37. 解数独</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/37.-%E8%A7%A3%E6%95%B0%E7%8B%AC/</link><pubDate>Sun, 31 Aug 2025 21:57:21 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/37.-%E8%A7%A3%E6%95%B0%E7%8B%AC/</guid><description>围绕「解数独」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>36. 有效的数独</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/36.-%E6%9C%89%E6%95%88%E7%9A%84%E6%95%B0%E7%8B%AC/</link><pubDate>Sat, 30 Aug 2025 22:54:04 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/36.-%E6%9C%89%E6%95%88%E7%9A%84%E6%95%B0%E7%8B%AC/</guid><description>围绕「有效的数独」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3021. Alice 和 Bob 玩鲜花游戏</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3021.-alice-%E5%92%8C-bob-%E7%8E%A9%E9%B2%9C%E8%8A%B1%E6%B8%B8%E6%88%8F/</link><pubDate>Fri, 29 Aug 2025 18:40:14 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3021.-alice-%E5%92%8C-bob-%E7%8E%A9%E9%B2%9C%E8%8A%B1%E6%B8%B8%E6%88%8F/</guid><description>围绕「Alice 和 Bob 玩鲜花游戏」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3446. 按对角线进行矩阵排序</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3446.-%E6%8C%89%E5%AF%B9%E8%A7%92%E7%BA%BF%E8%BF%9B%E8%A1%8C%E7%9F%A9%E9%98%B5%E6%8E%92%E5%BA%8F/</link><pubDate>Thu, 28 Aug 2025 23:40:54 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3446.-%E6%8C%89%E5%AF%B9%E8%A7%92%E7%BA%BF%E8%BF%9B%E8%A1%8C%E7%9F%A9%E9%98%B5%E6%8E%92%E5%BA%8F/</guid><description>围绕「按对角线进行矩阵排序」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3459. 最长 V 形对角线段的长度</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3459.-%E6%9C%80%E9%95%BF-v-%E5%BD%A2%E5%AF%B9%E8%A7%92%E7%BA%BF%E6%AE%B5%E7%9A%84%E9%95%BF%E5%BA%A6/</link><pubDate>Wed, 27 Aug 2025 23:51:09 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3459.-%E6%9C%80%E9%95%BF-v-%E5%BD%A2%E5%AF%B9%E8%A7%92%E7%BA%BF%E6%AE%B5%E7%9A%84%E9%95%BF%E5%BA%A6/</guid><description>围绕「最长 V 形对角线段的长度」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3000. 对角线最长的矩形的面积</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3000.-%E5%AF%B9%E8%A7%92%E7%BA%BF%E6%9C%80%E9%95%BF%E7%9A%84%E7%9F%A9%E5%BD%A2%E7%9A%84%E9%9D%A2%E7%A7%AF/</link><pubDate>Tue, 26 Aug 2025 21:43:46 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3000.-%E5%AF%B9%E8%A7%92%E7%BA%BF%E6%9C%80%E9%95%BF%E7%9A%84%E7%9F%A9%E5%BD%A2%E7%9A%84%E9%9D%A2%E7%A7%AF/</guid><description>围绕「对角线最长的矩形的面积」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>498. 对角线遍历</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/498.-%E5%AF%B9%E8%A7%92%E7%BA%BF%E9%81%8D%E5%8E%86/</link><pubDate>Mon, 25 Aug 2025 21:19:19 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/498.-%E5%AF%B9%E8%A7%92%E7%BA%BF%E9%81%8D%E5%8E%86/</guid><description>围绕「对角线遍历」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1493. 删掉一个元素以后全为 1 的最长子数组</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1493.-%E5%88%A0%E6%8E%89%E4%B8%80%E4%B8%AA%E5%85%83%E7%B4%A0%E4%BB%A5%E5%90%8E%E5%85%A8%E4%B8%BA-1-%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E6%95%B0%E7%BB%84/</link><pubDate>Sun, 24 Aug 2025 20:54:20 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1493.-%E5%88%A0%E6%8E%89%E4%B8%80%E4%B8%AA%E5%85%83%E7%B4%A0%E4%BB%A5%E5%90%8E%E5%85%A8%E4%B8%BA-1-%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E6%95%B0%E7%BB%84/</guid><description>围绕「删掉一个元素以后全为 1 的最长子数组」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3197. 包含所有 1 的最小矩形面积 II</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3197.-%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89-1-%E7%9A%84%E6%9C%80%E5%B0%8F%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF-ii/</link><pubDate>Sat, 23 Aug 2025 17:16:54 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3197.-%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89-1-%E7%9A%84%E6%9C%80%E5%B0%8F%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF-ii/</guid><description>围绕「包含所有 1 的最小矩形面积 II」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3195. 包含所有 1 的最小矩形面积 I</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3195.-%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89-1-%E7%9A%84%E6%9C%80%E5%B0%8F%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF-i/</link><pubDate>Fri, 22 Aug 2025 15:52:56 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3195.-%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89-1-%E7%9A%84%E6%9C%80%E5%B0%8F%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF-i/</guid><description>围绕「包含所有 1 的最小矩形面积 I」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1504. 统计全 1 子矩形</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1504.-%E7%BB%9F%E8%AE%A1%E5%85%A8-1-%E5%AD%90%E7%9F%A9%E5%BD%A2/</link><pubDate>Thu, 21 Aug 2025 16:55:48 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1504.-%E7%BB%9F%E8%AE%A1%E5%85%A8-1-%E5%AD%90%E7%9F%A9%E5%BD%A2/</guid><description>围绕「统计全 1 子矩形」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>326. 3 的幂</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/326.-3-%E7%9A%84%E5%B9%82/</link><pubDate>Wed, 20 Aug 2025 15:25:53 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/326.-3-%E7%9A%84%E5%B9%82/</guid><description>围绕「3 的幂」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1277. 统计全为 1 的正方形子矩阵</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1277.-%E7%BB%9F%E8%AE%A1%E5%85%A8%E4%B8%BA-1-%E7%9A%84%E6%AD%A3%E6%96%B9%E5%BD%A2%E5%AD%90%E7%9F%A9%E9%98%B5/</link><pubDate>Wed, 20 Aug 2025 15:04:55 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1277.-%E7%BB%9F%E8%AE%A1%E5%85%A8%E4%B8%BA-1-%E7%9A%84%E6%AD%A3%E6%96%B9%E5%BD%A2%E5%AD%90%E7%9F%A9%E9%98%B5/</guid><description>围绕「统计全为 1 的正方形子矩阵」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2348. 全 0 子数组的数目</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2348.-%E5%85%A8-0-%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE/</link><pubDate>Tue, 19 Aug 2025 19:49:11 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2348.-%E5%85%A8-0-%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE/</guid><description>围绕「全 0 子数组的数目」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2438. 二的幂数组中查询范围内的乘积</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2438.-%E4%BA%8C%E7%9A%84%E5%B9%82%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E8%AF%A2%E8%8C%83%E5%9B%B4%E5%86%85%E7%9A%84%E4%B9%98%E7%A7%AF/</link><pubDate>Mon, 11 Aug 2025 17:56:19 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2438.-%E4%BA%8C%E7%9A%84%E5%B9%82%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E8%AF%A2%E8%8C%83%E5%9B%B4%E5%86%85%E7%9A%84%E4%B9%98%E7%A7%AF/</guid><description>围绕「二的幂数组中查询范围内的乘积」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>869. 重新排序得到 2 的幂</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/869.-%E9%87%8D%E6%96%B0%E6%8E%92%E5%BA%8F%E5%BE%97%E5%88%B0-2-%E7%9A%84%E5%B9%82/</link><pubDate>Sun, 10 Aug 2025 15:26:15 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/869.-%E9%87%8D%E6%96%B0%E6%8E%92%E5%BA%8F%E5%BE%97%E5%88%B0-2-%E7%9A%84%E5%B9%82/</guid><description>围绕「重新排序得到 2 的幂」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>231. 2 的幂</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/231.-2-%E7%9A%84%E5%B9%82/</link><pubDate>Sat, 09 Aug 2025 15:12:15 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/231.-2-%E7%9A%84%E5%B9%82/</guid><description>围绕「2 的幂」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>808. 分汤</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/808.-%E5%88%86%E6%B1%A4/</link><pubDate>Fri, 08 Aug 2025 23:03:11 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/808.-%E5%88%86%E6%B1%A4/</guid><description>围绕「分汤」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3363. 最多可收集的水果数目</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3363.-%E6%9C%80%E5%A4%9A%E5%8F%AF%E6%94%B6%E9%9B%86%E7%9A%84%E6%B0%B4%E6%9E%9C%E6%95%B0%E7%9B%AE/</link><pubDate>Thu, 07 Aug 2025 14:13:14 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3363.-%E6%9C%80%E5%A4%9A%E5%8F%AF%E6%94%B6%E9%9B%86%E7%9A%84%E6%B0%B4%E6%9E%9C%E6%95%B0%E7%9B%AE/</guid><description>围绕「最多可收集的水果数目」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3479. 水果成篮 III</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3479.-%E6%B0%B4%E6%9E%9C%E6%88%90%E7%AF%AE-iii/</link><pubDate>Wed, 06 Aug 2025 22:17:33 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3479.-%E6%B0%B4%E6%9E%9C%E6%88%90%E7%AF%AE-iii/</guid><description>围绕「水果成篮 III」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3477. 水果成篮 II</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3477.-%E6%B0%B4%E6%9E%9C%E6%88%90%E7%AF%AE-ii/</link><pubDate>Tue, 05 Aug 2025 11:18:40 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3477.-%E6%B0%B4%E6%9E%9C%E6%88%90%E7%AF%AE-ii/</guid><description>围绕「水果成篮 II」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>904. 水果成篮</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/904.-%E6%B0%B4%E6%9E%9C%E6%88%90%E7%AF%AE/</link><pubDate>Mon, 04 Aug 2025 21:26:26 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/904.-%E6%B0%B4%E6%9E%9C%E6%88%90%E7%AF%AE/</guid><description>围绕「水果成篮」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2.DeFi-Introduction to Blockchain Technology</title><link>https://beautifulremi.dpdns.org/post/web3/defi/2.defi-introduction-to-blockchain-technology/</link><pubDate>Sun, 03 Aug 2025 14:58:34 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/defi/2.defi-introduction-to-blockchain-technology/</guid><description>这是整个区块链系统的信任基石。在一个没有中央机构的去中心化网络里，所有参与者（节点）必须通过一种方式，就交易的顺序和有效性达成一致意见。</description></item><item><title>2106. 摘水果</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2106.-%E6%91%98%E6%B0%B4%E6%9E%9C/</link><pubDate>Sun, 03 Aug 2025 14:46:40 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2106.-%E6%91%98%E6%B0%B4%E6%9E%9C/</guid><description>围绕「摘水果」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2561. 重排水果</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2561.-%E9%87%8D%E6%8E%92%E6%B0%B4%E6%9E%9C/</link><pubDate>Sat, 02 Aug 2025 23:12:46 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2561.-%E9%87%8D%E6%8E%92%E6%B0%B4%E6%9E%9C/</guid><description>围绕「重排水果」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>118. 杨辉三角</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/118.-%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92/</link><pubDate>Fri, 01 Aug 2025 21:38:26 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/118.-%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92/</guid><description>围绕「杨辉三角」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2683. 相邻值的按位异或</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2683.-%E7%9B%B8%E9%82%BB%E5%80%BC%E7%9A%84%E6%8C%89%E4%BD%8D%E5%BC%82%E6%88%96/</link><pubDate>Thu, 31 Jul 2025 23:03:12 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2683.-%E7%9B%B8%E9%82%BB%E5%80%BC%E7%9A%84%E6%8C%89%E4%BD%8D%E5%BC%82%E6%88%96/</guid><description>围绕「相邻值的按位异或」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2419. 按位与最大的最长子数组</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2419.-%E6%8C%89%E4%BD%8D%E4%B8%8E%E6%9C%80%E5%A4%A7%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E6%95%B0%E7%BB%84/</link><pubDate>Wed, 30 Jul 2025 23:32:31 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2419.-%E6%8C%89%E4%BD%8D%E4%B8%8E%E6%9C%80%E5%A4%A7%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E6%95%B0%E7%BB%84/</guid><description>围绕「按位与最大的最长子数组」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2411. 按位或最大的最小子数组长度</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2411.-%E6%8C%89%E4%BD%8D%E6%88%96%E6%9C%80%E5%A4%A7%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%90%E6%95%B0%E7%BB%84%E9%95%BF%E5%BA%A6/</link><pubDate>Tue, 29 Jul 2025 22:29:17 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2411.-%E6%8C%89%E4%BD%8D%E6%88%96%E6%9C%80%E5%A4%A7%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%90%E6%95%B0%E7%BB%84%E9%95%BF%E5%BA%A6/</guid><description>围绕「按位或最大的最小子数组长度」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>2044. 统计按位或能得到最大值的子集数目</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2044.-%E7%BB%9F%E8%AE%A1%E6%8C%89%E4%BD%8D%E6%88%96%E8%83%BD%E5%BE%97%E5%88%B0%E6%9C%80%E5%A4%A7%E5%80%BC%E7%9A%84%E5%AD%90%E9%9B%86%E6%95%B0%E7%9B%AE/</link><pubDate>Mon, 28 Jul 2025 18:04:59 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2044.-%E7%BB%9F%E8%AE%A1%E6%8C%89%E4%BD%8D%E6%88%96%E8%83%BD%E5%BE%97%E5%88%B0%E6%9C%80%E5%A4%A7%E5%80%BC%E7%9A%84%E5%AD%90%E9%9B%86%E6%95%B0%E7%9B%AE/</guid><description>围绕「统计按位或能得到最大值的子集数目」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>C++中的标准库函数对象</title><link>https://beautifulremi.dpdns.org/post/c++/c++%E4%B8%AD%E7%9A%84%E6%A0%87%E5%87%86%E5%BA%93%E5%87%BD%E6%95%B0%E5%AF%B9%E8%B1%A1/</link><pubDate>Mon, 28 Jul 2025 01:32:37 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/c++/c++%E4%B8%AD%E7%9A%84%E6%A0%87%E5%87%86%E5%BA%93%E5%87%BD%E6%95%B0%E5%AF%B9%E8%B1%A1/</guid><description>首先，一个函数对象（也常被称为仿函数 Functor），其本质是一个重载了函数调用运算符 operator() 的类的对象。</description></item><item><title>C++ 中的左值和右值</title><link>https://beautifulremi.dpdns.org/post/c++/c++-%E4%B8%AD%E7%9A%84%E5%B7%A6%E5%80%BC%E5%92%8C%E5%8F%B3%E5%80%BC/</link><pubDate>Mon, 28 Jul 2025 01:10:49 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/c++/c++-%E4%B8%AD%E7%9A%84%E5%B7%A6%E5%80%BC%E5%92%8C%E5%8F%B3%E5%80%BC/</guid><description>左值 (lvalue, locator value): 可以放在赋值运算符=左边的表达式。它代表一个有身份 (identity) 的、持久的对象或内存位置。</description></item><item><title>C++中视图（View）对象适配器</title><link>https://beautifulremi.dpdns.org/post/c++/c++%E4%B8%AD%E8%A7%86%E5%9B%BEview%E5%AF%B9%E8%B1%A1%E9%80%82%E9%85%8D%E5%99%A8/</link><pubDate>Mon, 28 Jul 2025 00:54:13 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/c++/c++%E4%B8%AD%E8%A7%86%E5%9B%BEview%E5%AF%B9%E8%B1%A1%E9%80%82%E9%85%8D%E5%99%A8/</guid><description>功能 views::all 的核心功能是确保你正在处理一个视图（view）。它接收一个范围（range），并返回一个代表该范围的视图。</description></item><item><title>C++20的范围库</title><link>https://beautifulremi.dpdns.org/post/c++/c++20%E7%9A%84%E8%8C%83%E5%9B%B4%E5%BA%93/</link><pubDate>Sun, 27 Jul 2025 22:24:05 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/c++/c++20%E7%9A%84%E8%8C%83%E5%9B%B4%E5%BA%93/</guid><description>C++20 中最具变革性的特性之一：范围库 (Ranges Library)，彻底改变了我们与标准模板库（STL）算法交互的方式。</description></item><item><title>C++20的宇宙飞船</title><link>https://beautifulremi.dpdns.org/post/c++/c++20%E7%9A%84%E5%AE%87%E5%AE%99%E9%A3%9E%E8%88%B9/</link><pubDate>Sun, 27 Jul 2025 21:17:56 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/c++/c++20%E7%9A%84%E5%AE%87%E5%AE%99%E9%A3%9E%E8%88%B9/</guid><description>C++添加了运算符，当使用 a b 时，它返回的不是一个简单的布尔值 (true/false) 或整数。</description></item><item><title>2210. 统计数组中峰和谷的数量</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2210.-%E7%BB%9F%E8%AE%A1%E6%95%B0%E7%BB%84%E4%B8%AD%E5%B3%B0%E5%92%8C%E8%B0%B7%E7%9A%84%E6%95%B0%E9%87%8F/</link><pubDate>Sun, 27 Jul 2025 21:08:12 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2210.-%E7%BB%9F%E8%AE%A1%E6%95%B0%E7%BB%84%E4%B8%AD%E5%B3%B0%E5%92%8C%E8%B0%B7%E7%9A%84%E6%95%B0%E9%87%8F/</guid><description>围绕「统计数组中峰和谷的数量」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>3480. 删除一个冲突对后最大子数组数目</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3480.-%E5%88%A0%E9%99%A4%E4%B8%80%E4%B8%AA%E5%86%B2%E7%AA%81%E5%AF%B9%E5%90%8E%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE/</link><pubDate>Sat, 26 Jul 2025 16:34:29 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3480.-%E5%88%A0%E9%99%A4%E4%B8%80%E4%B8%AA%E5%86%B2%E7%AA%81%E5%AF%B9%E5%90%8E%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE/</guid><description>围绕「删除一个冲突对后最大子数组数目」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1.DeFi-Intro to DeFi</title><link>https://beautifulremi.dpdns.org/post/web3/defi/1.defi-intro-to-defi/</link><pubDate>Fri, 25 Jul 2025 15:06:14 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/defi/1.defi-intro-to-defi/</guid><description>去中心化金融（Decentralized Finance，简称DeFi）是一个建立在区块链技术之上的新兴金融体系。</description></item><item><title>3487. 删除后的最大子数组元素和</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3487.-%E5%88%A0%E9%99%A4%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E5%92%8C/</link><pubDate>Fri, 25 Jul 2025 14:46:49 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/3487.-%E5%88%A0%E9%99%A4%E5%90%8E%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E5%92%8C/</guid><description>围绕「删除后的最大子数组元素和」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>8.ETH-权益证明</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/8.eth-%E6%9D%83%E7%9B%8A%E8%AF%81%E6%98%8E/</link><pubDate>Thu, 24 Jul 2025 17:14:41 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/8.eth-%E6%9D%83%E7%9B%8A%E8%AF%81%E6%98%8E/</guid><description>PoW认为，信任和安全来自于不可逆的物理成本。矿工必须购买昂贵的硬件（矿机）并消耗大量电力来解决复杂的数学难题。</description></item><item><title>7.ETH-难度调整</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/7.eth-%E9%9A%BE%E5%BA%A6%E8%B0%83%E6%95%B4/</link><pubDate>Thu, 24 Jul 2025 16:24:34 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/7.eth-%E9%9A%BE%E5%BA%A6%E8%B0%83%E6%95%B4/</guid><description>在过渡到权益证明（Proof-of-Stake, PoS）之前。</description></item><item><title>2322. 从树中删除边的最小分数</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2322.-%E4%BB%8E%E6%A0%91%E4%B8%AD%E5%88%A0%E9%99%A4%E8%BE%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E5%88%86%E6%95%B0/</link><pubDate>Thu, 24 Jul 2025 14:58:20 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2322.-%E4%BB%8E%E6%A0%91%E4%B8%AD%E5%88%A0%E9%99%A4%E8%BE%B9%E7%9A%84%E6%9C%80%E5%B0%8F%E5%88%86%E6%95%B0/</guid><description>围绕「从树中删除边的最小分数」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1717. 删除子字符串的最大得分</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1717.-%E5%88%A0%E9%99%A4%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86/</link><pubDate>Wed, 23 Jul 2025 22:23:17 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1717.-%E5%88%A0%E9%99%A4%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86/</guid><description>围绕「删除子字符串的最大得分」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>12.ETH-美链</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/12.eth-%E7%BE%8E%E9%93%BE/</link><pubDate>Tue, 22 Jul 2025 22:06:52 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/12.eth-%E7%BE%8E%E9%93%BE/</guid><description>ERC-20 本身不是一个代币，也不是一段代码，而是一套“技术标准”或“接口规范”。</description></item><item><title>11.ETH-反思</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/11.eth-%E5%8F%8D%E6%80%9D/</link><pubDate>Tue, 22 Jul 2025 20:13:22 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/11.eth-%E5%8F%8D%E6%80%9D/</guid><description>智能合约所指的智能并不是指其拥有智慧，而是指它能以一种更自动化、更高效、自我执行的方式来处理和强制执行协议。</description></item><item><title>10.ETH-The DAO</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/10.eth-the-dao/</link><pubDate>Tue, 22 Jul 2025 17:41:04 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/10.eth-the-dao/</guid><description>The DAO 是历史上第一个尝试以“去中心化自治组织（Decentralized Autonomous。</description></item><item><title>9.ETH-智能合约</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/9.eth-%E6%99%BA%E8%83%BD%E5%90%88%E7%BA%A6/</link><pubDate>Tue, 22 Jul 2025 14:28:34 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/9.eth-%E6%99%BA%E8%83%BD%E5%90%88%E7%BA%A6/</guid><description>Solidity是以太坊中最常用的编程语言，这是一个公开拍卖智能合约的例子。</description></item><item><title>1695. 删除子数组的最大得分</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1695.-%E5%88%A0%E9%99%A4%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86/</link><pubDate>Tue, 22 Jul 2025 14:14:21 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1695.-%E5%88%A0%E9%99%A4%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%BE%97%E5%88%86/</guid><description>围绕「删除子数组的最大得分」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>1233. 删除子文件夹</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1233.-%E5%88%A0%E9%99%A4%E5%AD%90%E6%96%87%E4%BB%B6%E5%A4%B9/</link><pubDate>Sat, 19 Jul 2025 23:33:42 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/1233.-%E5%88%A0%E9%99%A4%E5%AD%90%E6%96%87%E4%BB%B6%E5%A4%B9/</guid><description>围绕「删除子文件夹」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>使用堆计算数据流中位数和百分位数</title><link>https://beautifulremi.dpdns.org/post/c++/%E4%BD%BF%E7%94%A8%E5%A0%86%E8%AE%A1%E7%AE%97%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E4%BD%8D%E6%95%B0%E5%92%8C%E7%99%BE%E5%88%86%E4%BD%8D%E6%95%B0/</link><pubDate>Fri, 18 Jul 2025 17:58:28 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/c++/%E4%BD%BF%E7%94%A8%E5%A0%86%E8%AE%A1%E7%AE%97%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E4%BD%8D%E6%95%B0%E5%92%8C%E7%99%BE%E5%88%86%E4%BD%8D%E6%95%B0/</guid><description>中位数是将一个数据集分成数量相等的上下两部分的值。我们的核心思想就是维护这两个“部分”。</description></item><item><title>堆（Heap）</title><link>https://beautifulremi.dpdns.org/post/c++/%E5%A0%86heap/</link><pubDate>Fri, 18 Jul 2025 17:54:51 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/c++/%E5%A0%86heap/</guid><description>堆（Heap）本质上是一种特殊的树状数据结构，通常用完全二叉树来实现。它的主要特点是满足“堆属性”。</description></item><item><title>2163. 删除元素后和的最小差值</title><link>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2163.-%E5%88%A0%E9%99%A4%E5%85%83%E7%B4%A0%E5%90%8E%E5%92%8C%E7%9A%84%E6%9C%80%E5%B0%8F%E5%B7%AE%E5%80%BC/</link><pubDate>Mon, 14 Jul 2025 00:29:55 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/%E5%8A%9B%E6%89%A3/2163.-%E5%88%A0%E9%99%A4%E5%85%83%E7%B4%A0%E5%90%8E%E5%92%8C%E7%9A%84%E6%9C%80%E5%B0%8F%E5%B7%AE%E5%80%BC/</guid><description>围绕「删除元素后和的最小差值」这道 LeetCode 题，记录题意理解、解题思路与实现要点。</description></item><item><title>6.ETH-挖矿算法</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/6.eth-%E6%8C%96%E7%9F%BF%E7%AE%97%E6%B3%95/</link><pubDate>Mon, 30 Jun 2025 17:06:39 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/6.eth-%E6%8C%96%E7%9F%BF%E7%AE%97%E6%B3%95/</guid><description>在比特币网络中，ASIC矿机的出现使得拥有大规模、高算力硬件的矿工占据了绝对优势，普通用户使用CPU或GPU几乎无法参与挖矿。</description></item><item><title>5.ETH-GHOST协议(PoW)</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/5.eth-ghost%E5%8D%8F%E8%AE%AEpow/</link><pubDate>Sun, 29 Jun 2025 18:06:19 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/5.eth-ghost%E5%8D%8F%E8%AE%AEpow/</guid><description>GHOST协议的出现是为了解决一个核心矛盾：如何在保证网络安全和去中心化的前提下，大幅缩短区块链的出块时间。</description></item><item><title>4.ETH-交易树和收据树</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/4.eth-%E4%BA%A4%E6%98%93%E6%A0%91%E5%92%8C%E6%94%B6%E6%8D%AE%E6%A0%91/</link><pubDate>Sun, 29 Jun 2025 16:57:06 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/4.eth-%E4%BA%A4%E6%98%93%E6%A0%91%E5%92%8C%E6%94%B6%E6%8D%AE%E6%A0%91/</guid><description>交易树是为每一个区块单独构建的、一次性的数据结构，它的唯一目的就是存储该区块内包含的所有交易，并为它们生成一个唯一的、可验证的“指纹”。</description></item><item><title>3.ETH-状态树</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/3.eth-%E7%8A%B6%E6%80%81%E6%A0%91/</link><pubDate>Sat, 28 Jun 2025 18:49:36 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/3.eth-%E7%8A%B6%E6%80%81%E6%A0%91/</guid><description>以太坊的核心功能，就是维护一个从“地址 (Address)”到其对应“状态 (State)”的、持续更新的、全球共享的巨大映射（Mapping）关系。</description></item><item><title>2.ETH-账户</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/2.eth-%E8%B4%A6%E6%88%B7/</link><pubDate>Sat, 28 Jun 2025 17:43:09 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/2.eth-%E8%B4%A6%E6%88%B7/</guid><description>比特币的账本不记录任何人的“账户余额”。它只记录一笔笔“未被花费的交易输出”，即 UTXO (Unspent Transaction Output)。</description></item><item><title>1.ETH-概述</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/1.eth-%E6%A6%82%E8%BF%B0/</link><pubDate>Sat, 28 Jun 2025 17:16:55 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/eth/1.eth-%E6%A6%82%E8%BF%B0/</guid><description>以太坊是一个开源、去中心化的全球计算平台。它不仅仅是一种像比特币那样的数字货币，更是一个强大的基础设施，允许任何人在其上构建和运行去中心化的应用程序。</description></item><item><title>10.BTC-匿名性</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/10.btc-%E5%8C%BF%E5%90%8D%E6%80%A7/</link><pubDate>Fri, 27 Jun 2025 20:49:32 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/10.btc-%E5%8C%BF%E5%90%8D%E6%80%A7/</guid><description>比特币的隐私模型更应该被准确地描述为 “假名性”（Pseudonymity），而非“匿名性”（Anonymity）。</description></item><item><title>9.BTC-分叉</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/9.btc-%E5%88%86%E5%8F%89/</link><pubDate>Fri, 27 Jun 2025 17:22:05 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/9.btc-%E5%88%86%E5%8F%89/</guid><description>分叉的本质，就是对整个比特币网络“宪法”（即共识规则）的修改。</description></item><item><title>8.BTC-脚本</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/8.btc-%E8%84%9A%E6%9C%AC/</link><pubDate>Sun, 15 Jun 2025 23:49:40 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/8.btc-%E8%84%9A%E6%9C%AC/</guid><description>比特币的脚本语言，通常直接称为 Script，是比特币协议的核心组成部分之一。它是一种有意设计得非常简单、功能受限的编程语言，主要负责处理交易的验证和授权。</description></item><item><title>7.BTC-挖矿</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/7.btc-%E6%8C%96%E7%9F%BF/</link><pubDate>Sun, 15 Jun 2025 17:50:41 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/7.btc-%E6%8C%96%E7%9F%BF/</guid><description>技术与工具：在这个阶段，矿工就是比特币的创造者中本聪和一小撮早期的密码学爱好者。他们使用的工具就是我们日常使用的个人电脑的中央处理器（CPU）。</description></item><item><title>6.BTC-挖矿难度</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/6.btc-%E6%8C%96%E7%9F%BF%E9%9A%BE%E5%BA%A6/</link><pubDate>Sun, 15 Jun 2025 17:11:53 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/6.btc-%E6%8C%96%E7%9F%BF%E9%9A%BE%E5%BA%A6/</guid><description>难度调整这个过程是完全自动的，被硬编码在比特币协议中，由网络中的每一个全节点独立计算和强制执行。</description></item><item><title>5.BTC-网络</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/5.btc-%E7%BD%91%E7%BB%9C/</link><pubDate>Sun, 15 Jun 2025 16:17:05 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/5.btc-%E7%BD%91%E7%BB%9C/</guid><description>BTC在应用层以Bitcion Block Chain为总和，运行着一个Bitcoin P2P Protocol。</description></item><item><title>4.BTC-具体实现</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/4.btc-%E5%85%B7%E4%BD%93%E5%AE%9E%E7%8E%B0/</link><pubDate>Sat, 14 Jun 2025 17:24:59 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/4.btc-%E5%85%B7%E4%BD%93%E5%AE%9E%E7%8E%B0/</guid><description>BTC使用UTXO模型 (Unspent Transaction Output Model - 未花费的交易输出模型)，简单来说。</description></item><item><title>3.BTC-协议</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/3.btc-%E5%8D%8F%E8%AE%AE/</link><pubDate>Sat, 14 Jun 2025 13:46:06 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/3.btc-%E5%8D%8F%E8%AE%AE/</guid><description>BTC中的公私钥解决了证明所有权和授权交易两个部分。私钥是你对某个地址下数字资产的唯一所有权证明，而数字签名是对一笔交易的、不可否认的授权。</description></item><item><title>2.BTC-数据结构</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/2.btc-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/</link><pubDate>Sat, 14 Jun 2025 03:55:10 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/2.btc-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/</guid><description>哈希指针不仅存储了数据的内存地址，还额外存储了那块数据内容的加密哈希值。 组成：一个哈希指针包含两个部分： 指针 (Pointer)：指向数据的存储位置。</description></item><item><title>1.BTC-密码学原理</title><link>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/1.btc-%E5%AF%86%E7%A0%81%E5%AD%A6%E5%8E%9F%E7%90%86/</link><pubDate>Sat, 14 Jun 2025 02:28:19 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/web3/%E5%8C%BA%E5%9D%97%E9%93%BE/btc/1.btc-%E5%AF%86%E7%A0%81%E5%AD%A6%E5%8E%9F%E7%90%86/</guid><description>BTC中用到了密码学中的两个原理，哈希和签名。</description></item><item><title>C++关于迭代器的操作</title><link>https://beautifulremi.dpdns.org/post/c++/c++%E5%85%B3%E4%BA%8E%E8%BF%AD%E4%BB%A3%E5%99%A8%E7%9A%84%E6%93%8D%E4%BD%9C/</link><pubDate>Sat, 07 Jun 2025 00:00:38 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/c++/c++%E5%85%B3%E4%BA%8E%E8%BF%AD%E4%BB%A3%E5%99%A8%E7%9A%84%E6%93%8D%E4%BD%9C/</guid><description>通用迭代器 std::advance(it, n) it：要移动的迭代器（按引用传递，会被修改） n：移动的步数（整数，正数向前。</description></item><item><title>C++的进阶操作</title><link>https://beautifulremi.dpdns.org/post/c++/c++%E7%9A%84%E8%BF%9B%E9%98%B6%E6%93%8D%E4%BD%9C/</link><pubDate>Fri, 06 Jun 2025 21:38:50 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/c++/c++%E7%9A%84%E8%BF%9B%E9%98%B6%E6%93%8D%E4%BD%9C/</guid><description>std::stack 是一种后进先出（Last-In, First-Out，简称 LIFO）的数据结构。</description></item><item><title>OJ模拟测试</title><link>https://beautifulremi.dpdns.org/post/c++/oj%E6%A8%A1%E6%8B%9F%E6%B5%8B%E8%AF%95/</link><pubDate>Fri, 06 Jun 2025 21:17:45 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/c++/oj%E6%A8%A1%E6%8B%9F%E6%B5%8B%E8%AF%95/</guid><description>读入N名学生的成绩，计算获得某一给定分数的学生人数。</description></item><item><title>基于范围的 for 循环（C++11）</title><link>https://beautifulremi.dpdns.org/post/c++/%E5%9F%BA%E4%BA%8E%E8%8C%83%E5%9B%B4%E7%9A%84-for-%E5%BE%AA%E7%8E%AFc++11/</link><pubDate>Thu, 05 Jun 2025 18:14:10 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/c++/%E5%9F%BA%E4%BA%8E%E8%8C%83%E5%9B%B4%E7%9A%84-for-%E5%BE%AA%E7%8E%AFc++11/</guid><description>declaration: 声明一个变量，用于在每次迭代中存储 range_expression 中的一个元素。</description></item><item><title>OJ-1</title><link>https://beautifulremi.dpdns.org/post/c++/oj-1/</link><pubDate>Thu, 05 Jun 2025 17:45:05 +0800</pubDate><guid>https://beautifulremi.dpdns.org/post/c++/oj-1/</guid><description>基本是对基础Vector的应用，这里复习一下： 构造vector变量。</description></item></channel></rss>