forked from sachuverma/DataStructures-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPowxn.cpp
52 lines (45 loc) · 727 Bytes
/
Powxn.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/*
Pow(x, n)
=========
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
Constraints:
-100.0 < x < 100.0
-231 <= n <= 231-1
-104 <= xn <= 104
*/
class Solution
{
public:
double myPow(double x, int n)
{
long long N = abs(n);
double ans = 1.0;
while (N > 0)
{
if (N % 2 == 1)
{
ans = ans * x;
N--;
}
else
{
x = x * x;
N = N / 2;
}
}
if (n < 0)
return 1.0 / ans;
else
return ans;
}
};