#50

Pow(x, n)

medium · verified · 38.3% accepted · 11,589 likes · top 17%

math · recursion

⊣ practice⊣ quiz⊣ open on leetcode ↗

Description

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

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

Solution