69. Sqrt(x)

原题

Implement int sqrt(int x).

Compute and return the square root of x.

代码实现

        public int MySqrt(int x)
        {
            if(x==0 || x==1)return x;
            int lo = 0, hi = x ;
            while (lo - hi < -1)
            {
            //get [lo,hi] middle point,then compare pow2 to x,
            // lo or hi is setted by mid
            //so accelarate the process
                long mid = lo + (hi - lo) / 2; //prevent overflowing
                long pow2 = mid * mid; //prevent overflowing
                if (pow2 < x) lo = (int)mid;
                else if (pow2 > x) hi = (int)mid;
                else return (int)mid;
            }
            return lo;
        }

leetcode-solution库

leetcode算法题目解决方案每天更新在github库中，欢迎感兴趣的朋友加入进来，也欢迎star，或pull request。https://github.com/jackzhenguo/leetcode-csharp