zoukankan      html  css  js  c++  java
  • 迭代法与开根号求值(letcode 69)

    一、理论证明

    由以上推导易得公式为:Xk+1 = (Xk +a/Xk)/2


    代码实现:

     

    class Solution {
    public:
        int mySqrt(int x) {
            double last_pre = 3.000;
            for(int i = 0;i < 32;i++){
                double cur_num = (pre_num + double(x)/pre_num)/2.0000;
                last_num = cur_num;
            }
            return last_num;
        }
    };

     

     

  • 相关阅读:
    053364
    053363
    oracle导出批量表N行记录
    053362
    053361
    053360
    053359
    053358
    053357
    053356
  • 原文地址:https://www.cnblogs.com/jake9402/p/7572122.html
Copyright © 2011-2022 走看看