练习
pow某数据的N次幂
#include <iostream>
class Solution {
public:
double mypow(double x, int n) {
double res = 1.0;
for (int i = n; i != 0; i /= 2) {
if (i % 2 != 0) {
res *= x;
}
x *= x;
}
return n < 0 ? 1 / res : res;
}
};
int main() {
Solution test;
double res = test.mypow(2,5);
std::cout << res << std::endl;
}