摘要: 迭代法求快速幂 pow(x, n). class Solution { public: double multiply(double x, long long n) { double ans = 1.0; double base_x = x; while (n > 0) { if (n % 2 == 阅读全文
posted @ 2021-12-06 00:11 算是一个初学者 阅读(82) 评论(0) 推荐(0)