<?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%90%9C%E7%B4%A2%E5%8C%BA%E9%97%B4/</link><description>Recent content in 搜索区间 on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>zh-cn</language><lastBuildDate>Fri, 14 Aug 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E6%90%9C%E7%B4%A2%E5%8C%BA%E9%97%B4/index.xml" rel="self" type="application/rss+xml"/><item><title>二分查找区间怎么选：从候选集合到边界更新</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/binary-search/binary-search-interval-conventions/</link><pubDate>Fri, 14 Aug 2026 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/binary-search/binary-search-interval-conventions/</guid><description>从候选集合出发，理解二分查找的闭区间、左闭右开区间和开区间哨兵写法，以及初始化、循环条件与边界更新为什么必须配套。</description></item></channel></rss>