this is my c++ solution


  • 0
    M

    int mySqrt(int x) {
    const int maxr=46340; //sqrt(0x7fffffff)
    int r=x<maxr?x:maxr; //sqrt(x)<sqrt(0x7fffffff)
    while(r*r>x)
    {
    r=(r+x/r)>>1;
    }
    return r;
    }


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.