Pow(double x, int n)

Implement pow(x, n).

    double pow(double x, int n) 
    {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (n == 0)
            return 1.0;
            
        if (n == 1)
            return x;
            
        bool isPos = true;
        if (n < 0)
        {
            n = -n;
            isPos = false;
        }
            
        double half = pow(x, n/2); 
        double mul = (n&1 ? x : 1.0) * half *half;
        
        return isPos? mul: 1.0/mul;
    }