<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title>Rust - 标签 - Ciel's blog</title><link>https://www.cielyang.top/tags/Rust/</link><description>Rust - 标签 - Ciel's blog</description><generator>Hugo -- gohugo.io</generator><language>zh-CN</language><managingEditor>cielsk43@gmail.com (Ciel Yang)</managingEditor><webMaster>cielsk43@gmail.com (Ciel Yang)</webMaster><lastBuildDate>Sun, 28 May 2023 14:40:36 +0800</lastBuildDate><atom:link href="https://www.cielyang.top/tags/Rust/" rel="self" type="application/rss+xml"/><item><title>LeetCode 1335 工作计划的最低难度</title><link>https://www.cielyang.top/posts/LeetCode-1335-%E5%B7%A5%E4%BD%9C%E8%AE%A1%E5%88%92%E7%9A%84%E6%9C%80%E4%BD%8E%E9%9A%BE%E5%BA%A6/</link><pubDate>Sun, 28 May 2023 14:40:36 +0800</pubDate><author><name>Ciel Yang</name></author><guid>https://www.cielyang.top/posts/LeetCode-1335-%E5%B7%A5%E4%BD%9C%E8%AE%A1%E5%88%92%E7%9A%84%E6%9C%80%E4%BD%8E%E9%9A%BE%E5%BA%A6/</guid><description>&lt;p>本题是一道经典的“极小极大化”问题，又结合了动态规划的考察，难度集中于数据建模过程而非编码阶段。&lt;/p></description></item><item><title>LeetCode 2106 摘水果</title><link>https://www.cielyang.top/posts/LeetCode-2106-%E6%91%98%E6%B0%B4%E6%9E%9C/</link><pubDate>Sun, 07 May 2023 07:51:30 +0800</pubDate><author><name>Ciel Yang</name></author><guid>https://www.cielyang.top/posts/LeetCode-2106-%E6%91%98%E6%B0%B4%E6%9E%9C/</guid><description>&lt;p>本题的解题思路比较简单，更多考验编码细节，比如：合并冗余代码、起止条件处理等。&lt;/p></description></item></channel></rss>