Package g0301_0400.s0372_super_pow

Class Solution

java.lang.Object

g0301_0400.s0372_super_pow.Solution

public class Solution
extends Object

372 - Super Pow.<p>Medium</p> <p>Your task is to calculate <code>a^b</code> mod <code>1337</code> where <code>a</code> is a positive integer and <code>b</code> is an extremely large positive integer given in the form of an array.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> a = 2, b = [3]</p> <p><strong>Output:</strong> 8</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> a = 2, b = [1,0]</p> <p><strong>Output:</strong> 1024</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> a = 1, b = [4,3,3,8,5,2]</p> <p><strong>Output:</strong> 1</p> <p><strong>Example 4:</strong></p> <p><strong>Input:</strong> a = 2147483647, b = [2,0,0]</p> <p><strong>Output:</strong> 1198</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= a <= 2³¹ - 1</code></li> <li><code>1 <= b.length <= 2000</code></li> <li><code>0 <= b[i] <= 9</code></li> <li><code>b</code> doesn&rsquo;t contain leading zeros.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	superPow(int a, int[] b)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

superPow

public int superPow(int a,
 int[] b)