二分查找 leetcode704

class Solution {    public int search(int[] nums, int target) {        int l=0;        int r=nums.length-1;        while(l<=r)        {            int mid=l+(r-l)/2;            if(nums[mid]==target)                return mid;            if(nums[mid]>target)            {                r=mid-1;            }            else                l=mid+1;        }        return -1;    }}

转载于:https://www.cnblogs.com/cold-windy/p/11205763.html