[leetcode 50. Pow(x, n)]week 11
来源:互联网 发布:黄金利多利空数据软件 编辑:程序博客网 时间:2024/06/05 02:27
一、题目
Implement pow(x, n).
二、代码
class Solution {
public:
double myPow(double x, int n) {
if (n<0){
double tmp=myPower(x,-n);
return 1.0/tmp;
}
else
return myPower(x,n);
}
double myPower(double x, int n) {
if (n==0)
return 1;
double tmp=myPower(x,n/2);
if (n%2==0)
return tmp*tmp;
else
return tmp*tmp*x;
}
};
三、思路
对n分情况进行,另开一个函数递归调用得到结果。
阅读全文
0 0
- [leetcode 50. Pow(x, n)]week 11
- [week 13][Leetcode][Divide and Conquer] Pow(x, n)
- [LeetCode]50.Pow(x, n)
- LeetCode --- 50. Pow(x, n)
- [Leetcode] 50. Pow(x, n)
- [leetcode] 50.Pow(x, n)
- LeetCode 50. Pow(x, n)
- 50. Pow(x, n) LeetCode
- [leetcode] 50. Pow(x, n)
- Leetcode 50. Pow(x, n)
- [LeetCode]50. Pow(x, n)
- LeetCode *** 50. Pow(x, n)
- LeetCode 50. Pow(x, n)
- LeetCode 50. Pow(x, n)
- 【LeetCode】50. Pow(x, n)
- [leetcode]50. Pow(x, n)
- LeetCode-50.Pow(x, n)
- LeetCode - 50. Pow(x, n)
- Tomcat 学习 应用
- [leetcode 204. Count Primes]week 3
- [leetcode 104. Maximum Depth of Binary Tree]week 5
- 80端口被占用 PID 4
- [leetcode 55. Jump Game]week 7
- [leetcode 50. Pow(x, n)]week 11
- [leetcode 19 Remove Nth Node From End of List]week 13
- 两类strling数
- [leetcode Merge Two Sorted Lists]week 15
- [leetcode Search Insert Position]week 17
- Linux(redhat6.5)下 安装mysql5.7.18——yum方式
- [leetcode Best Time to Buy and Sell Stock]week 18
- [leetcode Maximum Subarray]week 19
- 线性表(List)---顺序存储结构