MCPcopy Create free account
hub / github.com/LjyYano/LeetCode / quickPow

Method quickPow

src/main/java/L0372_SuperPow.java:54–68  ·  view source on GitHub ↗

快速幂算法计算 (x^n) % MOD

(int x, int n)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

superPowMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected