题目要求:
实现函数double Power(double base,int exponent),求base的exponent次方。
不得使用库函数,不需要考虑溢出。
参考资料:剑指offer第11题。
题目分析:
考虑情况:
1.底数为0,指数为非负;
2.底数为0,指数为负;
3.底数非0,指数为负;
4.底数非0,指数为正;
O(logN)时间复杂度的实现方法:把指数分解成二进制数,对应位为1则乘以相应倍数的底数。
代码实现:
#include <iostream>
using namespace std;
bool isInputValid = true;
double Power(double base,int exponent);
int main(void)
{
double result = Power(0,1);
if(isInputValid)
cout << result << endl;
isInputValid = true;
result = Power(0,-1);
if(isInputValid)
cout << result << endl;
isInputValid = true;
result = Power(0.8,-1);
if(isInputValid)
cout << result << endl;
isInputValid = true;
result = Power(0.8,2);
if(isInputValid)
cout << result << endl;
return 0;
}
bool Equal(double a,double b)
{
if((a-b>-0.0000001) && (a-b<0.0000001))
return true;
else
return false;
}
double Power(double base,int exponent)
{
//情况1
if(Equal(base,0.0) && exponent>=0)
return 0;
//情况2
else if(Equal(base,0.0) && exponent<0)
{
cout << "底为0,指数不能为负" << endl;
isInputValid = false;
return 0;
}
//情况3
else if(!Equal(base,0.0) && exponent<0)
return 1/Power(base,-exponent);
//情况4
else
{
double result = 1;
while(exponent)
{
if(exponent & 0x01)
result *= base;
base *= base;
exponent >>= 1;
}
return result;
}
}