来源于Leetcode

C++

  

   

    

     

    
    

     

      int binarySearch(vector<int>& nums, int target){
     
    
   

    

     

    
    

     
  if(nums.size() == 0)
     
    
   

    

     

    
    

     
    return -1;
     
    
   

    

     

    
    

     
 
     
    
   

    

     

    
    

     
  int left = 0, right = nums.size() - 1;
     
    
   

    

     

    
    

     
  while(left <= right){
     
    
   

    

     

    
    

     
    // Prevent (left + right) overflow
     
    
   

    

     

    
    

     
    int mid = left + (right - left) / 2;
     
    
   

    

     

    
    

     
    if(nums[mid] == target){ return mid; }
     
    
   

    

     

    
    

     
    else if(nums[mid] < target) { left = mid + 1; }
     
    
   

    

     

    
    

     
    else { right = mid - 1; }
     
    
   

    

     

    
    

     

        }
     
    
   

    

     

    
    

     
 
     
    
   

    

     

    
    

     
  // End Condition: left > right
     
    
   

    

     

    
    

     
  return -1;
     
    
   

    

     

    
    

     

      }
     
    
  
 

Python 

  

   

    

     

    
    

     

      def binarySearch(nums, target):
     
    
   

    

     

    
    

     
    """
     
    
   

    

     

    
    

     

       :type nums: List[int]
     
    
   

    

     

    
    

     

       :type target: int
     
    
   

    

     

    
    

     

       :rtype: int
     
    
   

    

     

    
    

     

       """
     
    
   

    

     

    
    

     
    if len(nums) == 0:
     
    
   

    

     

    
    

     
        return -1
     
    
   

    

     

    
    

     
 
     
    
   

    

     

    
    

     

          left, right = 0, len(nums) - 1
     
    
   

    

     

    
    

     
    while left <= right:
     
    
   

    

     

    
    

     

              mid = (left + right) // 2
     
    
   

    

     

    
    

     
        if nums[mid] == target:
     
    
   

    

     

    
    

     
            return mid
     
    
   

    

     

    
    

     
        elif nums[mid] < target:
     
    
   

    

     

    
    

     

                  left = mid + 1
     
    
   

    

     

    
    

     
        else:
     
    
   

    

     

    
    

     

                  right = mid - 1
     
    
   

    

     

    
    

     
 
     
    
   

    

     

    
    

     
    # End Condition: left > right
     
    
   

    

     

    
    

     
    return -1
     
    
  
 

文章来源: blog.csdn.net，作者：沧夜2021，版权归原作者所有，如需转载，请联系作者。

原文链接：blog.csdn.net/CANGYE0504/article/details/89602704