LeetCode 69 - Sqrt(x)

Sqrt(x)

Implement int sqrt(int x).

Compute and return the square root of x.

My Code

class Solution {
public:
    int mySqrt(int x) {
        if (x == 0)
            return 0;
        else if (x <= 3)
            return 1;
            
        long long l = 2, r = x / 2, m;
        while (l <= r)
        {
            m = (l + r) / 2;
            if (m * m > x)
                r = m - 1;
            else if (m * m < x)
                l = m + 1;
            else
                return m;
        }
        
        if (m * m <= x)
            return m;
        else
            return (m - 1);
    }
};

Runtime: 6 ms