<?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/%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84/</link><description>Recent content in 旋转数组 on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>zh-cn</language><lastBuildDate>Tue, 28 Jul 2026 16:13:57 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 153：寻找旋转排序数组中的最小值</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/153-find-minimum-in-rotated-sorted-array/</link><pubDate>Tue, 28 Jul 2026 16:13:57 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/153-find-minimum-in-rotated-sorted-array/</guid><description>从线性扫描基线推导包含最小值的闭区间与二分更新，在 O(log n) 时间、O(1) 额外空间内返回旋转数组的最小值。</description></item><item><title>LeetCode 33：搜索旋转排序数组</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/33-search-in-rotated-sorted-array/</link><pubDate>Tue, 28 Jul 2026 15:40:34 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/33-search-in-rotated-sorted-array/</guid><description>从线性扫描基线推导旋转数组中的有序半区与目标范围判断，在 O(log n) 时间、O(1) 额外空间内完成搜索。</description></item></channel></rss>