Leetcode#50||Pow (x, n)

public class Solution {
    public double myPow(double x, int n) {
         if (n < 0) {
             return 1 / pow(x, -n);
         } else {
             return pow(x, n);
         }
    }
    
    private double pow (double x, int n) {
        if (n == 0) {
            return 1;
        }
        
        double s = pow(x, n / 2);
        
        if (n % 2 == 0) {
            return s * s;
        } else {
            return s * s * x;
        }
    }
}