leetcode_372. Super Pow

Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.

Example1:

a = 2

b = [3]

Result: 8

Example2:

a = 2

b = [1,0]

Result: 1024

提示：提交代码后，需要用简洁的语言解释一下代码思路~ 谢谢

历史题目和总结见公众号「每日一道算法题」

https://leetcode.com/problems/super-pow/description/

思路：