二分查找

• https://leetcode.cn/problems/binary-search/description/

数组结构边界, 可视为内嵌的双指针.

int mid = left + (right - left) / 2; //向下整除 

int mid = left + ((right - left) >> 1);