LeetCode-Pow(x, n)

bsbcarter

于 2015-03-11 00:10:23 发布

阅读量315

点赞数

分类专栏：计算 leetcode

本文链接：https://blog.csdn.net/bsbcarter/article/details/44186719

版权

leetcode 同时被 2 个专栏收录

220 篇文章 0 订阅

订阅专栏

计算

16 篇文章 0 订阅

订阅专栏

Recursive:

public class Solution {
    public double pow(double x, int n) {
        if ( n == 0 )
            return 1;
        double half = pow ( x, n/2);
        double res = 1.0;
        if ( n % 2 == 0 ){
            res = half * half;
        }
        else if ( n > 0)
            res = half * half * x;
        else 
            res = half * half / x;
        return res;
    }
}

Iterative:

public class Solution {
    public double pow(double x, int n) {
        if ( n == 0 )
            return 1;
        double res = 1.0;
        for ( int i = n; i != 0; i/=2 ){
            if ( i % 2 != 0 )
                res *= x;
            x *= x;
        }
        if ( n < 0 )
            res = 1.0/res;
        return res;
    }
}