https://jeanphilogong.github.io/jeanblog/zh/tags/leetcode-34/Recent content in LeetCode 34 on Jeanphilo BlogHugo -- 0.168.0zh-cnThu, 04 Dec 2025 11:00:00 +0800https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/hot100/34-find-first-and-last-position-of-element-in-sorted-array/Thu, 04 Dec 2025 11:00:00 +0800https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/hot100/34-find-first-and-last-position-of-element-in-sorted-array/从线性扫描基线出发，推导两个半开区间二分边界，在 O(log n) 时间内返回目标值的完整范围。