Leetcode 372. Super Pow

两个先验知识：

1. ab%k = (a%k)(b%k)%k

2. a^(mn)%k = (a^m%k)^n%k

令f(a, b)=a^b % k，则 f(a,1234567) = f(a, 1234560) * f(a, 7) % k = f(f(a, 123456),10) * f(a,7)%k;

class Solution(object):

    def subPow(self, a, b): #0<= b <= 10
        if b == 0:
            return 1
        result = a % 1337
        for i in range(2, b+1):
            result = result * (a % 1337) % 1337
        return result
        
    
    def superPow(self, a, b):
        """
        :type a: int
        :type b: List[int]
        :rtype: int
        """
        # (a^21) % 1337 = (a^20 * a ^ 1) % 1337
        #               = (a^20 % 1337) * (a^1 % 1337) % 1337
        #               = (a^2 % 1337)^10%1337 * (a^1 % 1337) % 1337
        if len(b) >= 2:
            return self.subPow(self.superPow(a, b[:-1]), 10) * self.subPow(a, b[-1]) % 1337
        else:
            return self.subPow(a, b[0])