Pow(x,n)
来源:互联网 发布:单片机应用技术 编辑:程序博客网 时间:2024/05/01 16:24
Question:
Implement pow(x, n).
//********** Hints ************
如果用正常recursion会超时,此题可以用对分来处理
//*****************************
Solution:
public class Solution {
public double pow(double x, int n) {
long l = n;
if(l >= 0)
return power(x, l);
else
return 1/power(x, -l);
}
public double power(double x, long l){
if(l == 1)
return x;
if(l == 0)
return 1;
double result = power(x, l>>1);
result *= result;
if((l & 0x1) == 1)
result *= x;
return result;
}
}
0 0
- Pow(x, n) / Super Pow
- 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)
- Pow(x, n)
- 【leetcode】Pow(x, n)
- Pow(x, n)
- 求 pow(x, n)
- [LeetCode]Pow(x, n)
- Pow(x,n)
- Pow(x, n)
- Pow(x, n)
- [leetcode]Pow(x, n)
- LeetCode-Pow(x, n)
- 3Sum
- Valid Parentheses
- Merge Two Sorted List
- Implement strStr()
- 安装pvfs2
- Pow(x,n)
- Lesson 2: Udacity Intro to Parallel Programming
- liuru jia ACM训练指南链接(转载自BearChild blog)
- LeetCode - Merge k Sorted Lists
- 计算机视觉代码资源
- LeetCode - Generate Parentheses
- 小伙为挽回女友雨雪中跪地6小时
- LeetCode - Single Number
- 笔记 绝望主妇第1季 第1章--- desperate housewives session 1 episode 1