题解 | #二分查找-I#

using System;
using System.Collections.Generic;


class Solution {

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

        }
        return -1;

    }
}