69. Sqrt(x)

Posted 妖域大都督

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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.

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.

 

解题思路:

这道题目可以用二分法来不断猜测根的值并进行逼近。

 

代码:

class Solution {
public:
    int mySqrt(int x) {
        if(x <= 1)
            return x;
        int left = 0;
        int right = x;
        while(left < right){
            int mid = (left + right)/2;
            if(x / mid >= mid)
                left = mid+1;
            else
                right = mid;
        }
        return right-1;
    }
};

 

以上是关于69. Sqrt(x)的主要内容,如果未能解决你的问题,请参考以下文章

leetcode二分 | 牛顿迭代法69_Sqrt(x)

Leetcode 69. Sqrt(x)

69. Sqrt(x)

LeeCode from 0 —— 69. Sqrt(x)

69. Sqrt(x)

69. Sqrt(x)