leetcode No.69 x的平方根

时间复杂度beat100%

class Solution {
    public int mySqrt(int x) {
        if(x<=1) return x;
        long n=x;        
        while(!(n*n<=x&&(n+1)*(n+1)>x))
            n=(x/n+n)/2;
        return (int)n;
    }
}