二分查找模板三可以进行优化

The binary search template three can be optimized, and can be initialized as left = -1, which solves the problem of two candidates. You can refer to the video at https://www.bilibili.com/video/BV1AP41137w7/