二分查找的表達方式

1. int binarySearch(int[] nums, int target) {
       int left = 0, right = ...;
   
       while(...) {
           int mid = left + (right - left) / 2;
           if (nums[mid] == target) {
               ...
           } else if (nums[mid] < target) {
               left = ...
           } else if (nums[mid] > target) {
               right = ...
           }
       }
       return ...;
   }

   2.

       //...
       while(left < right) {
           // ...
       }
       return nums[left] == target ? left : -1;