[leetcode]Sqrt(x)

Implement int sqrt(int x).

Compute and return the square root of x.

二分搜索

class Solution {
public:
    int sqrt(int x) {
        if(x==1||x==2||x==3) return 1;
        return binary(0,x,x);

    }
    int binary(int min,int max,int x){
        long long mid =(long long) (max+min)/2;
        if(mid*mid <= x && (mid+1)*(mid+1)>x) return mid;
        else if(mid*mid > x) return binary(min,mid-1,x);
        else return binary(mid+1,max,x);
    }

};