50. Pow(x, n)

Problem Description:

Implement pow(xn), which calculates x raised to the power n (xn).

Example 1:

Input: 2.00000, 10
Output: 1024.00000

Example 2:

Input: 2.10000, 3
Output: 9.26100

Example 3:

Input: 2.00000, -2
Output: 0.25000
Explanation: 2-2 = 1/22 = 1/4 = 0.25

Note:

  • -100.0 < x < 100.0
  • n is a 32-bit signed integer, within the range [−231, 231 − 1]

Code:

class Solution {
    public double myPow(double x, int n) {
        if(x == 0 && n == 0)
            return 1;
        if(x == 0) 
            return 0;
        if(n == 0 || x - 1 == 0) 
            return 1;
        // watch out the int/long about the precision issue
        double res = func(x, Math.abs((long)n));
        if(n < 0) {
            return 1/res;
        }
        return res;
    }
    double func(double x, long n) {
        if(n/2 == 0) {
            return n%2==1?x:1;    
        } 
        // pay attention to the Math.pow function
        double t;
        return n%2==1?x*(t=func(x,n/2))*t:(t=func(x,n/2))*t;
    }
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值