题目要求
实现一个函数,输入基数和指数,就该基数的指数次方
注意点
处理0的非正数幂的情况处理,可以抛异常,这里用的断言
实现原理
比如求2的16次方,则先求2的8次方,然后平方即可得到16次方的值
用递归的方法求解
代码实现
#include<iostream>
using namespace std;
#include<assert.h>
double PowerWithUnsignedExponent(double base, size_t exponent)
{
//如果指数为0,那么返回1
//如果指数为1,然会基数
if (exponent == 0)
return 1;
if (exponent == 1)
return base;
//递归求指数的一半
//求下来的返回值的平方既是当前的解
double ret = PowerWithUnsignedExponent(base, exponent >> 1);
ret *= ret;
//这里要对基数幂做处理
if ((exponent & 0x1) == 1)
ret *= base;
return ret;
}
//面试题11-求一个数的N次方
double Power(double base, int exponent)
{
//如果基数为0并且指数小于0,断言报错
assert(base != 0.0 || exponent >= 0);
//先求出指数的绝对值
size_t absExponent = (size_t)(exponent);
//如果指数是小于0的,指数需要算成正数
if (exponent < 0)
absExponent = (size_t)(-exponent);
//递归求解
double ret = PowerWithUnsignedExponent(base, absExponent);
//如果指数是小于0的,求倒
if (exponent < 0)
ret = 1.0 / ret;
return ret;
}
测试函数
void TestPower()
{
cout << "Power(0, 2): " << Power(0, 2) << endl;
cout << "Power(1, 2): " << Power(1, 2) << endl;
cout << "Power(2, -1): " << Power(2, -1) << endl;
cout << "Power(2, 0): " << Power(2, 0) << endl;
cout << "Power(2, 1): " << Power(2, 1) << endl;
cout << "Power(2, 2): " << Power(2, 2) << endl;
cout << "Power(2, 3): " << Power(2, 3) << endl;
//断言报错
cout << "Power(0, -1): " << Power(0, -1) << endl;
}
为了方便查看代码,将代码放到了github上
点这里查看 https://github.com/haohaosong/SharpSword/blob/master/Offer-11.h