We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
求n^m.
暴力求解 m次乘法,复杂度O(m)
快速幂 把m分解为2^k1+2^k2+...+2^0,只需要分别计算n^ki,再乘在一起就行了.复杂度O(log(m))