-
Notifications
You must be signed in to change notification settings - Fork 0
/
Pow.java
41 lines (35 loc) · 808 Bytes
/
Pow.java
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
/* https://leetcode.com/problems/powx-n/ */
/*
50. 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
n is an integer.
Either x is not zero or n > 0.
-104 <= xn <= 104
*/
class Pow {
public double myPow(double x, int n) {
if (n == Integer.MAX_VALUE) return x;
else if (n == Integer.MIN_VALUE) return (x == 1 || x == -1) ? 1 : 0;
if(n<0) {
x=1/x;
n*=-1;
}
double ans = 1;
for(int i=0;i<n;i++)
ans = ans*x;
return ans;
}
}