Leetcode19: Pow(x,n)
2015-05-01 16:05
302 查看
Implement pow(x, n).
class Solution { public: double myPow(double x, int n) { if(n == 0) return 1.0; if(n < 0) return 1.0/myPow(x, -n); double half = myPow(x, n>>1); if(n%2 == 0) return half*half; else return half*half*x; } };
相关文章推荐
- leetcode[19]Remove Nth Node From End of List
- LeetCode(50)Pow
- LeetCode 19 Remove Nth Node From End of List
- 19. Remove Nth Node From End of List LeetCode
- 【Leetcode】【python】Pow(x, n)
- [LeetCode] 19. Remove Nth Node From End of List
- leetcode19---Remove Nth Node From End of List
- leetcode 34 : Pow(x, n)
- [leetcode 19] N-Queens
- [leetcode Maximum Subarray]week 19
- (java)leetcode-50:Pow(x, n)
- LeetCode *** 19. Remove Nth Node From End of List
- [LeetCode]50 Pow(x, n)
- [leetcode] Implement pow(x, n). Subscribe to see which companies asked this question
- [Leetcode题目]19. Remove Nth Node From End of List
- [C++]LeetCode 19: Remove Nth Node From End of List(删除链表中倒数第n个节点)
- [Leetcode] Pow(x, n)
- LeetCode 050 Pow(x, n)
- [LeetCode]pow(double x,int n)解题报告
- LeetCode_19、100两题