Java | Leetcode Java题解之第372题超级次方

题目：

题解：

class Solution {static final int MOD = 1337;public int superPow(int a, int[] b) {int ans = 1;for (int e : b) {ans = (int) ((long) pow(ans, 10) * pow(a, e) % MOD);}return ans;}public int pow(int x, int n) {int res = 1;while (n != 0) {if (n % 2 != 0) {res = (int) ((long) res * x % MOD);}x = (int) ((long) x * x % MOD);n /= 2;}return res;}
}