10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/cb0f98aea04386f6.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/cb0f98aea04386f6.js"],"default"] 12:T4b4,class Solution: def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int: mod = 10**9 + 7 dp = [[[0, 0] for _ in range(one + 1)] for _ in range(zero + 1)] for i in range(zero + 1): for j in range(one + 1): for lastBit in range(2): if i == 0: if lastBit == 0 or j > limit: dp[i][j][lastBit] = 0 else: dp[i][j][lastBit] = 1 elif j == 0: if lastBit == 1 or i > limit: dp[i][j][lastBit] = 0 else: dp[i][j][lastBit] = 1 elif lastBit == 0: dp[i][j][lastBit] = (dp[i - 1][j][0] + dp[i - 1][j][1]) % mod if i > limit: dp[i][j][lastBit] = (dp[i][j][lastBit] - dp[i - 1 - limit][j][1] + mod) % mod else: dp[i][j][lastBit] = (dp[i][j - 1][0] + dp[i][j - 1][1]) % mod if j > limit: dp[i][j][lastBit] = (dp[i][j][lastBit] - dp[i][j - 1 - limit][0] + mod) % mod return (dp[zero][one][0] + dp[zero][one][1]) % mod13:T510,class Solution { public int numberOfStableArrays(int zero, int one, int limit) { int mod = 1000000007; long[][][] dp = new long[zero + 1][one + 1][2]; for (int i = 0; i <= zero; i++) { for (int j = 0; j <= one; j++) { for (int lastBit = 0; lastBit < 2; lastBit++) { if (i == 0) { dp[i][j][lastBit] = (lastBit == 0 || j > limit) ? 0 : 1; } else if (j == 0) { dp[i][j][lastBit] = (lastBit == 1 || i > limit) ? 0 : 1; } else if (lastBit == 0) { dp[i][j][lastBit] = (dp[i - 1][j][0] + dp[i - 1][j][1]) % mod; if (i > limit) { dp[i][j][lastBit] = (dp[i][j][lastBit] - dp[i - 1 - limit][j][1] + mod) % mod; } } else { dp[i][j][lastBit] = (dp[i][j - 1][0] + dp[i][j - 1][1]) % mod; if (j > limit) { dp[i][j][lastBit] = (dp[i][j][lastBit] - dp[i][j - 1 - limit][0] + mod) % mod; } } } } } return (int) ((dp[zero][one][0] + dp[zero][one][1]) % mod); } }14:T544,class Solution { public: int numberOfStableArrays(int zero, int one, int limit) { int mod = 1e9 + 7; vector>> dp(zero + 1, vector>(one + 1, vector(2, 0))); for (int i = 0; i <= zero; ++i) { for (int j = 0; j <= one; ++j) { for (int lastBit = 0; lastBit < 2; ++lastBit) { if (i == 0) { dp[i][j][lastBit] = (lastBit == 0 || j > limit) ? 0 : 1; } else if (j == 0) { dp[i][j][lastBit] = (lastBit == 1 || i > limit) ? 0 : 1; } else if (lastBit == 0) { dp[i][j][lastBit] = (dp[i - 1][j][0] + dp[i - 1][j][1]) % mod; if (i > limit) { dp[i][j][lastBit] = (dp[i][j][lastBit] - dp[i - 1 - limit][j][1] + mod) % mod; } } else { dp[i][j][lastBit] = (dp[i][j - 1][0] + dp[i][j - 1][1]) % mod; if (j > limit) { dp[i][j][lastBit] = (dp[i][j][lastBit] - dp[i][j - 1 - limit][0] + mod) % mod; } } }

Time Complexity

Space Complexity