leetcode 50 pow(x,y)
发布时间:2020-12-14 04:16:26 所属栏目:大数据 来源:网络整理
导读:Implement?pow( x ,? n ),which calculates? x ?raised to the power? n ?(xn). Example 1: Input: 2.00000,10Output: 1024.00000 Example 2: Input: 2.10000,3Output: 9.26100 Example 3: Input: 2.00000,-2Output: 0.25000Explanation: 2-2 = 1/22 = 1/4 =
Implement?pow(x,?n),which calculates?x?raised to the power?n?(xn). Example 1: Input: 2.00000,10 Output: 1024.00000 Example 2: Input: 2.10000,3 Output: 9.26100 Example 3: Input: 2.00000,-2 Output: 0.25000 Explanation: 2-2 = 1/22 = 1/4 = 0.25 Note:
可能是我想多了,因为int的负数范围比正数范围多一,转化为正整数要考虑他的一个范围 class Solution { public: double myPow(double x,int n) { long long m=n; if(n<0){return pow(1/x,0-m);} return pow(x,n); } double pow(double x,long long n) { if(0==n){return 1.0;} double a=0.0; a = pow(x,n/2); // cout<<a<<" "<<n<<endl; if(n%2){ return a*a*x; }else{ return a*a; } } }; ?感觉还是不太好,找到一篇文章写的很好 https://blog.csdn.net/gao__xue/article/details/80021207 (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |