LeetCode T50 Pow(x, n)

题目地址

https://leetcode-cn.com/problems/powx-n/

题目描述

Implement pow(x, n), which calculates x raised to the power n (i.e. xⁿ).

Example 1:

Input: x = 2.00000, n = 10
Output: 1024.00000

Example 2:

Input: x = 2.10000, n = 3
Output: 9.26100

Example 3:

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

Constraints:

• -100.0 < x < 100.0
• -2³¹ <= n <= 2³¹-1
• -10⁴ <= xn <= 10⁴

思路

快速幂

题解

class Solution {
    public double myPow(double x, int n) {
        if(n>=0) return getPow(x,n);
        else return 1/getPow(x,-n);
    }
    public double getPow(double x,int n){
        if(n==0) return 1.0;
        double y = getPow(x,n/2);
        return n%2 == 0?y*y:y*y*x;
    }
}