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
Solution：
思路：
https://leetcode.com/problems/super-pow/discuss/
Time Complexity: O(N) Space Complexity: O(N)
Solution Code：
