leetcode#372 Super Pow

1. 문제

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

2. 나의 풀이

class Solution:
    def superPow(self, a: int, b: List[int]) -> int:
        if a == 1:
            return a
        
        b.sort(reverse=True)
        max_num = int("".join([str(x) for x in b]))
        
        return pow(a, max_num, 1337)

Reference