<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>股票 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/%E8%82%A1%E7%A5%A8/</link><description>Recent content in 股票 on Jeanphilo Blog</description><generator>Hugo -- 0.163.3</generator><language>zh-cn</language><lastBuildDate>Fri, 03 Jul 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E8%82%A1%E7%A5%A8/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 121：买卖股票的最佳时机，从历史最低价推出一次交易贪心</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/greedy/121-best-time-to-buy-and-sell-stock/</link><pubDate>Fri, 03 Jul 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/greedy/121-best-time-to-buy-and-sell-stock/</guid><description>从买入必须早于卖出的顺序压力出发，推导 LeetCode 121 买卖股票的最佳时机：先写 O(n^2) 正确基线，再压缩成维护历史最低价的一次扫描贪心。</description></item></channel></rss>