leetcode快速冪—— 50. Pow(x, n)

class Solution { public double myPow(double x, int n) { int flag = n >= 0 ? 1 : -1; double res = quickPow(x, Math.abs(n)); if(flag == 1) return res; else return 1.

>>阅读原文<<