<?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/%E5%AD%97%E7%AC%A6%E6%95%B0%E7%BB%84/</link><description>Recent content in 字符数组 on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>zh-cn</language><lastBuildDate>Thu, 04 Dec 2025 11:30:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E5%AD%97%E7%AC%A6%E6%95%B0%E7%BB%84/index.xml" rel="self" type="application/rss+xml"/><item><title>比目标字母大的最小字母：有序字符数组上的二分查找技巧（LeetCode 744）</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/binary-search/744-find-smallest-letter-greater-than-target/</link><pubDate>Thu, 04 Dec 2025 11:30:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/binary-search/744-find-smallest-letter-greater-than-target/</guid><description>在排序字符数组中查找比目标字母大的最小字母（Find Smallest Letter Greater Than Target），支持环绕。本文用 upper_bound 二分模板稳定处理边界，并提供多语言实现和工程实践示例。</description></item></channel></rss>