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:T4c2,class Solution: def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int: dp = [[[0, 0] for _ in range(one + 1)] for _ in range(zero + 1)] mod = int(1e9 + 7) for i in range(min(zero, limit) + 1): dp[i][0][0] = 1 for j in range(min(one, limit) + 1): dp[0][j][1] = 1 for i in range(1, zero + 1): for j in range(1, one + 1): if i > limit: dp[i][j][0] = ( dp[i - 1][j][0] + dp[i - 1][j][1] - dp[i - limit - 1][j][1] ) else: dp[i][j][0] = dp[i - 1][j][0] + dp[i - 1][j][1] dp[i][j][0] = (dp[i][j][0] % mod + mod) % mod if j > limit: dp[i][j][1] = ( dp[i][j - 1][0] + dp[i][j - 1][1] - dp[i][j - limit - 1][0] ) else: dp[i][j][1] = dp[i][j - 1][0] + dp[i][j - 1][1] dp[i][j][1] = (dp[i][j][1] % mod + mod) % mod return (dp[zero][one][0] + dp[zero][one][1]) % mod13:T425,class Solution { public: int numberOfStableArrays(int zero, int one, int limit) { vector>> dp(zero + 1, vector>(one + 1, vector(2, 0))); int mod = 1e9 + 7; for (int i = 0; i <= min(zero, limit); i++) dp[i][0][0] = 1; for (int j = 0; j <= min(one, limit); j++) dp[0][j][1] = 1; for (int i = 1; i <= zero; i++) { for (int j = 1; j <= one; j++) { if (i > limit) dp[i][j][0] = (dp[i - 1][j][0] + dp[i - 1][j][1] - dp[i - limit - 1][j][1]) % mod; else dp[i][j][0] = (dp[i - 1][j][0] + dp[i - 1][j][1]) % mod; dp[i][j][0] = (dp[i][j][0] + mod) % mod; if (j > limit) dp[i][j][1] = (dp[i][j - 1][0] + dp[i][j - 1][1] - dp[i][j - limit - 1][0]) % mod; else dp[i][j][1] = (dp[i][j - 1][0] + dp[i][j - 1][1]) % mod; dp[i][j][1] = (dp[i][j][1] + mod) % mod; } } return (dp[zero][one][0] + dp[zero][one][1]) % mod; } };14:T443,/** * @param {number} zero * @param {number} one * @param {number} limit * @return {number} */ var numberOfStableArrays = function(zero, one, limit) { let dp = Array.from({ length: zero + 1 }, () => Array.from({ length: one + 1 }, () => [0, 0]) ); let mod = 1000000007n; for (let i = 0; i <= Math.min(zero, limit); i++) dp[i][0][0] = 1n; for (let j = 0; j <= Math.min(one, limit); j++) dp[0][j][1] = 1n; for (let i = 1; i <= zero; i++) { for (let j = 1; j <= one; j++) { if (i > limit) dp[i][j][0] = (dp[i - 1][j][0] + dp[i - 1][j][1] - dp[i - limit - 1][j][1]) % mod; else dp[i][j][0] = (dp[i - 1][j][0] + dp[i - 1][j][1]) % mod; dp[i][j][0] = (dp[i][j][0] + mod) % mod; if (j > limit) dp[i][j][1] = (dp[i][j - 1][0] + dp[i][j - 1][1] - dp[i][j - limit - 1][0]) % mod; else dp[i][j][1] = (dp[i][j - 1][0] + dp[i][j - 1][1]) % mod; dp[i][j][1] = (dp[i][j][1] + mod) % mod; } } return Number((dp[zero][one][0] + dp[zero][one][1]) % mod); };

Time Complexity

Space Complexity