递归实现高效率的幂运算

递归实现高效率的幂运算

public static long pow(long x, int n) {
    
    
        if (n == 0)
            return 1;
        if (n == 1)
            return x;
        if (isEven(x))
            return pow(x * x, n / 2);
        else
            return pow(x * x, n / 2) * x;
    }
    public static boolean isEven(long x) {
    
    
        return x % 2 == 0;
    }