69. Sqrt(x) (Easy)

https://leetcode.com/problems/sqrtx/

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.

Hints

Solutions

class Solution {
    public int mySqrt(int x) {
        int s = 0, e = x;
        long ans = 0L;
        while (s <= e) {
            long m = s + (e - s) / 2;
            long prod = m * m;
            if (prod <= x) {
                s = (int) (m + 1);
                ans = m;
            } else e = (int) m - 1;
        }
        return (int) ans;
    }
}
Copyright © iovi.com 2017 all right reserved,powered by GitbookLast Modification: 2019-04-09 11:57:41

results matching ""

    No results matching ""