剑指offer之一个数的N次方

求一个数的N次方，看起来简单，但实际上要考虑很多东西有很多，比如底数为0，指数为负等情况，下面是平常的算法和另外一种算法的代码：

#include<iostream>
#include<math.h>
using namespace std;


bool equal(double num1, double num2);
double PowerWithUnsignedExponent(double base, unsigned int exponent); 

double PowerSolution1(double base,int exponent)
{
    if(equal(base,0.0)&&exponent<0)
        return 0.0;
    if(exponent==0)
        return 1.0;
    unsigned int absExponent=(unsigned int) (exponent);
    double result;
    if(exponent<0)
        absExponent=(unsigned int)(-exponent);
    result=PowerWithUnsignedExponent(base,absExponent);
    if(exponent<0)
        result=1/result;
    return result;
}

double PowerSolution2(double base,unsigned int exponent)
{
    double result=1.0;
    if(exponent==0)
        return 1;
    if(exponent==1)
        return base;
    result=PowerSolution2(base,exponent>>1);
    result*=result;
    if(exponent&0x1==1)
        result*=base;
    return result;
}

void test(double base,int exponent,double expected)
{
    if(PowerSolution1(base,exponent)==expected)
        cout<<"solution1 pass"<<endl;
    else
        cout<<"solution1 fail"<<endl;
    if(PowerSolution2(base,exponent)==expected)
        cout<<"solution2 pass"<<endl;
    else
        cout<<"solution2 fail"<<endl;
}

double PowerWithUnsignedExponent(double base, unsigned int exponent)
{
    double result=1.0;
    for(int i=1;i<=exponent;i++)
    {
        result*=base;
    }
    return result;
}

bool equal(double num1, double num2)    
{
    if((num1-num2<=0.000001)||(num2-num1<=0.000001))
        return true;
    else
        return false;
}

int main()
{
    test(5,2,25);
    test(-5,2,25);
    test(-5,3,-125);
    test(5,0,1);
    test(0,0,1);
    test(0,5,0);
    test(0,-5,0);
    return 0;
}