Leetcode——69. 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.

Example1：

Input: 4
Output: 2

Example2：

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

解题思路

不适用Math的sqrt()方法来实现一个数的开根号操作。

Math分类下的问题的大部分解题思路就是通过二分法进行解题。这个题与之前很多的题的思路都差不多，在此不赘述。

AC代码

class Solution {
    public int mySqrt(int x) {
        if(x == 0)
            return 0;
        int start = 1, end = x;
        while(start + 1 < end) {
            int mid = start + (end - start) / 2;
            int val = x / mid;
            if(val == mid)
                return mid;
            else if(val > mid)
                start = mid;
            else
                end = mid;
        }

        return start;
    }
}