Sqrt(x)

https://leetcode.com/problems/sqrtx

这题实际上是要求实现牛顿法吧，但是暴力找也是可以accept 的，毕竟是以n^2 的速度逼近答案。

/**
 * @param {number} x
 * @return {number}
 */
var mySqrt = function(x) {
    var i;
    for (i = 1; i*i <= x; ++i);
    return i - 1;
};

console.log(mySqrt(0));

 

var mySqrt = function(x) {
     var r = x;
    while (r*r > x)
        r = ((r + x/r) / 2);
    return r;
}

 

转载于:https://www.cnblogs.com/agentgamer/p/6930910.html