[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fJYX7P2VEuUhUqxGXYQ-TS_tBV7fq_3yW_hHXq9NorbY":3},[4],{"slug":5,"title":6,"description":7,"pub_date":8,"tags":9,"draft":14},"algorithm-binary-search","二分查找：永远写不对？记住这个模板","彻底搞清楚二分查找的边界问题：闭区间和左闭右开两套模板、三道经典 LeetCode 题目完整 C++ 实现，以及二分答案的进阶思路。","2026-04-30",[10,11,12,13],"算法","二分查找","leetcode","cpp",false]