package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
# README
50. Pow(x, n)
Solution idea
简单的 Recursion. 注意：提前算好 pow(x, n/2), 避免重复计算.
Time complexity = $O(\log n)$
简单的 Recursion. 注意：提前算好 pow(x, n/2), 避免重复计算.
Time complexity = $O(\log n)$