算法之路---二分查找

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

在学校增加了 许多理论，实践都是混过去的哈哈哈！！！ 

下面是二分的实际应用

/* The isBadVersion API is defined in the parent class VersionControl.
      boolean isBadVersion(int version); */

public class Solution extends VersionControl {
    public int firstBadVersion(int n) {
        int left=1,rignt=n;
        while(left<rignt){
            int mid=left+(rignt-left)/2;
            if(isBadVersion(mid)){
                rignt=mid;
            }else{
                left=mid+1;
            }
        }
        return left;
    }
}