LeetCode Easy Sqrt(x)

Implement int sqrt(int x).

Compute and return the square root of x, where x is guaranteed to be a non-negative integer.

Since the return type is an integer, the decimal digits are truncated and only the integer part of the result is returned.

Example 1

Input: 4
Output: 2

Example 2

Input: 8
Output: 2
Explanation: The square root of 8 is 2.82842..., and since 
             the decimal part is truncated, 2 is returned.

Solution1

public class Solution1 {
    /**
     * Brute Force
     * Time Complexity: sqrt(x)
     * @param x int
     * @return sqrt(x) int
     */
    public int mySqrt(int x) {
        if (x <= 1) return x;
        for (long s = 1; s <= x; s++) {
            if (s * s > x) return (int) s - 1;
        }
        return -1;
    }
}

Solution2

public class Solution2 {
    /**
     * Binary Search
     * Time Complexity: O(log(n))
     * @param x int
     * @return int
     */
    public int mySqrt(int x) {
        int l = 1, r = x, m;
        while (l <= r) {
            m = l + (r - l) / 2;
            if (m > x / m) {
                r = m - 1;
            } else {
                l = m + 1;
            }
        }
        return r;
    }
}

Solution3

public class Solution3 {
    /**
     * Newton's method
     * Time Complexity: O(log(n))
     * @param x int
     * @return int
     */
    public int mySqrt(int x) {
        long ans = x;
        while (ans * ans > x) {
            ans = (ans + x / ans) / 2;
        }
        return (int) ans;
    }
}