class Solution {
public:
double pow(double x, int n) {
double res=cal(x,abs(n));
if(n<0)res=1/res;
return res;
}
double cal(double x,int n)
{
if(n==0)return 1;
if(n==1)return x;
if(n%2==1)return x*cal(x,n-1);
else{
double temp=cal(x,n/2);
return temp*temp;
}
}
};
``
https://leetcode-cn.com/problems/powx-n/
题目地址 https://leetcode.com/problems/powx-n/description/[ht...
题目地址 https://leetcode-cn.com/problems/powx-n/[https://lee...
问题链接 50. Pow(x, n)[https://leetcode.cn/problems/powx-n/] ...
50. Pow(x, n)[https://leetcode.cn/problems/powx-n/] 实现 po...
50. Pow(x, n)[https://leetcode.cn/problems/powx-n/] 实现 po...
本题来自Leetcode题目传送门[https://leetcode.cn/problems/powx-n/]难度...
https://leetcode.com/problems/powx-n/description/ 一道无聊的二分...
https://leetcode-cn.com/problems/powx-n/ 我的方法一：暴力法（超时） 步骤...
本文标题：powx-n
本文链接：https://www.haomeiwen.com/subject/cvvhlctx.html
网友评论