leetcode---Pow(x, n)---快速冪

Implement pow(x, n).web class Solution { public: double myPow(double x, int n) { double ans = 1; if(n > 0) { while(n) { if(n &

>>阅读原文<<