[LeetCode]69. Sqrt(x)

[LeetCode]69. Sqrt(x)

---

Implement int sqrt(int x).
Compute and return the square root of x.

实现sqrt(x)函数。

思想：二分查找m，使得m*m最接近x。

注意m*m会超过int的范围。

---

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