leetcode power (x,n)
来源:互联网 发布:软件测试工具qtp 编辑:程序博客网 时间:2024/05/19 10:36
1. 考虑double float 的相等,不能仅仅用==表示,是有精度限制的。
2. n 大于0,小于0的情况
3.
if (temp_diveded & 1) result *= base; base *= base; temp_diveded >>= 1;
想法很赞!!!!
#define ACCURACY 0.0000001class Solution {public: double pow(double x, int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if (n == 0) return 1.0; if (n==1) return x; if (equal(x, 1.0)) return x; if (equal(x,-1.0)){ if (n%2 == 0 ) return abs(x); else return -abs(x); } if (n < 0) return 1.0/pow(x, -n); double result = 1; double base = x; int temp_diveded = n; while (temp_diveded){ if (temp_diveded & 1) result *= base; base *= base; temp_diveded >>= 1; } return result; } bool equal(double x, double y){ return abs(x-y) <= ACCURACY; }};
- leetcode power (x,n)
- leetcode power(x, n)
- GeeksForGeeks Power(x,n)
- power(x,n)
- 【小熊刷题】power of two, pow(x, n) <Leetcode 231, 50 Java>
- x = power(a , (n -1)>>1);
- LeetCode: Pow(x, n)
- LeetCode Pow(x,n)
- [Leetcode] Pow(x, n)
- LeetCode: Pow(x, n)
- Leetcode: Pow(x,n)
- [LeetCode] Pow(x, n)
- [Leetcode] Pow(x,n)
- 【leetcode】Pow(x, n)
- [LeetCode]Pow(x, n)
- [leetcode]Pow(x, n)
- LeetCode-Pow(x, n)
- LeetCode - Pow(x, n)
- HDU 2037 今年暑假不AC
- Linux认证复习题100道含答案 --linux基本操作
- Distinct Subsequences
- osgclip例子
- 为了解决业余时间做项目自己给自己偷懒找接口的问题我开通的这个博客
- leetcode power (x,n)
- 宽度自适应
- HDU 1789 Doing Homework again
- 贵的未必是好的:T5220和X86服务器上Oracle性能之比较
- 川哥个人网页
- poj3077
- C++ 模板的特化与偏特化
- 图的遍历(邻接矩阵)
- 【无涯契】【八】