Java数据结构-二分查找模板（朴素、左右端点）

以下所有"......"根据具体题目要求和二段性填写

一.朴素二分模板

while (left <= right) {
    int mid = left + (right - left) / 2; // 防溢出
    if (......) right = mid - 1;
    else if(......) left = mid + 1;
    else return ......;
}

二.查找区间左右端点

1.左端点

while (left < right) {
    int mid = left + (right - left) / 2;
    if (......) left = mid + 1;
    else right = mid;
}

2.右端点

while (left < right) {
    int mid = left + (right - left + 1) / 2;
    if (......) left = mid;
    else right = mid - 1;
}