LeetCode 69. Sqrt(x)

最新推荐文章于 2024-10-22 10:05:07 发布

ActiveCoder

最新推荐文章于 2024-10-22 10:05:07 发布

阅读量181

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 题解

本文链接：https://blog.youkuaiyun.com/github_34333284/article/details/51295031

LeetCode 题解专栏收录该内容

288 篇文章

订阅专栏

本文深入探讨了二分查找算法及其在求平方根中的应用，并介绍了 Babylonian 方法，这是一种高效的双精度类数求平方根的技术。通过实例演示了如何使用这些算法解决实际问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Binary search.

#include <vector>
#include <iostream>
using namespace std;

int sqrt(int x) {
  long long left = 0;
  long long right = x;
  long long xx = x;
  while(left < right) {
    long long mid = (left + right) / 2;
    if(mid * mid <= xx && (mid + 1)* (mid + 1) > xx) {return (int) mid;}
    if(mid * mid < xx) left = mid + 1;
    else if(mid * mid > xx) right = mid - 1;
  }
}

int main(void) {
  int sq = sqrt(4);
  cout << sq << endl;
}

An algorithm named Babylonian method. Suppose we want to get 10's square root. First guess the result is 5. and then verify it.

5 != 0 ---> we get the next closer number: (5 + 10 / 5 ) /2 = 3, verify that 3 ! 5, we get the next closer number: (3 + 10 / 3 ) / 2 == 3, return 3. This method best works for double class.

double SQRT(const double fg) {
  double n = fg / 2.0;
  double lstx= 0.0;
  while(n != lstx) {
    lstx = n;
    n = (n + fg/n) / 2.0;
  }
  return n;
}