diff --git a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/README.md b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/README.md index cf541f2d459f9..c2b006949e5d9 100644 --- a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/README.md +++ b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/README.md @@ -176,41 +176,34 @@ class Solution { #### C++ ```cpp -using ll = long long; - class Solution { public: int numberOfStableArrays(int zero, int one, int limit) { - this->limit = limit; - f = vector>>(zero + 1, vector>(one + 1, {-1, -1})); - return (dfs(zero, one, 0) + dfs(zero, one, 1)) % mod; - } - -private: - const int mod = 1e9 + 7; - int limit; - vector>> f; - - ll dfs(int i, int j, int k) { - if (i < 0 || j < 0) { - return 0; - } - if (i == 0) { - return k == 1 && j <= limit; - } - if (j == 0) { - return k == 0 && i <= limit; - } - ll& res = f[i][j][k]; - if (res != -1) { + const int mod = 1e9 + 7; + using ll = long long; + vector>> f = vector>>(zero + 1, vector>(one + 1, {-1, -1})); + auto dfs = [&](auto&& dfs, int i, int j, int k) -> ll { + if (i < 0 || j < 0) { + return 0; + } + if (i == 0) { + return k == 1 && j <= limit; + } + if (j == 0) { + return k == 0 && i <= limit; + } + ll& res = f[i][j][k]; + if (res != -1) { + return res; + } + if (k == 0) { + res = (dfs(dfs, i - 1, j, 0) + dfs(dfs, i - 1, j, 1) - dfs(dfs, i - limit - 1, j, 1) + mod) % mod; + } else { + res = (dfs(dfs, i, j - 1, 0) + dfs(dfs, i, j - 1, 1) - dfs(dfs, i, j - limit - 1, 0) + mod) % mod; + } return res; - } - if (k == 0) { - res = (dfs(i - 1, j, 0) + dfs(i - 1, j, 1) - dfs(i - limit - 1, j, 1) + mod) % mod; - } else { - res = (dfs(i, j - 1, 0) + dfs(i, j - 1, 1) - dfs(i, j - limit - 1, 0) + mod) % mod; - } - return res; + }; + return (dfs(dfs, zero, one, 0) + dfs(dfs, zero, one, 1)) % mod; } }; ``` @@ -259,6 +252,41 @@ func numberOfStableArrays(zero int, one int, limit int) int { } ``` +#### TypeScript + +```ts +function numberOfStableArrays(zero: number, one: number, limit: number): number { + const mod = 1e9 + 7; + const f: number[][][] = Array.from({ length: zero + 1 }, () => + Array.from({ length: one + 1 }, () => [-1, -1]), + ); + + const dfs = (i: number, j: number, k: number): number => { + if (i < 0 || j < 0) { + return 0; + } + if (i === 0) { + return k === 1 && j <= limit ? 1 : 0; + } + if (j === 0) { + return k === 0 && i <= limit ? 1 : 0; + } + let res = f[i][j][k]; + if (res !== -1) { + return res; + } + if (k === 0) { + res = (dfs(i - 1, j, 0) + dfs(i - 1, j, 1) - dfs(i - limit - 1, j, 1) + mod) % mod; + } else { + res = (dfs(i, j - 1, 0) + dfs(i, j - 1, 1) - dfs(i, j - limit - 1, 0) + mod) % mod; + } + return (f[i][j][k] = res); + }; + + return (dfs(zero, one, 0) + dfs(zero, one, 1)) % mod; +} +``` + @@ -295,16 +323,10 @@ class Solution: f[0][j][1] = 1 for i in range(1, zero + 1): for j in range(1, one + 1): - f[i][j][0] = ( - f[i - 1][j][0] - + f[i - 1][j][1] - - (0 if i - limit - 1 < 0 else f[i - limit - 1][j][1]) - ) % mod - f[i][j][1] = ( - f[i][j - 1][0] - + f[i][j - 1][1] - - (0 if j - limit - 1 < 0 else f[i][j - limit - 1][0]) - ) % mod + x = 0 if i - limit - 1 < 0 else f[i - limit - 1][j][1] + y = 0 if j - limit - 1 < 0 else f[i][j - limit - 1][0] + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x) % mod + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y) % mod return sum(f[zero][one]) % mod ``` @@ -323,12 +345,10 @@ class Solution { } for (int i = 1; i <= zero; ++i) { for (int j = 1; j <= one; ++j) { - f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - - (i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]) + mod) - % mod; - f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - - (j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]) + mod) - % mod; + long x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + long y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; } } return (int) ((f[zero][one][0] + f[zero][one][1]) % mod); @@ -354,12 +374,10 @@ public: } for (int i = 1; i <= zero; ++i) { for (int j = 1; j <= one; ++j) { - f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - - (i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]) + mod) - % mod; - f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - - (j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]) + mod) - % mod; + ll x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + ll y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; } } return (f[zero][one][0] + f[zero][one][1]) % mod; @@ -398,6 +416,35 @@ func numberOfStableArrays(zero int, one int, limit int) int { } ``` +#### TypeScript + +```ts +function numberOfStableArrays(zero: number, one: number, limit: number): number { + const mod = 1e9 + 7; + const f: number[][][] = Array.from({ length: zero + 1 }, () => + Array.from({ length: one + 1 }, () => [0, 0]), + ); + + for (let i = 1; i <= Math.min(limit, zero); i++) { + f[i][0][0] = 1; + } + for (let j = 1; j <= Math.min(limit, one); j++) { + f[0][j][1] = 1; + } + + for (let i = 1; i <= zero; i++) { + for (let j = 1; j <= one; j++) { + const x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + const y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; + } + } + + return (f[zero][one][0] + f[zero][one][1]) % mod; +} +``` + diff --git a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/README_EN.md b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/README_EN.md index 68d2a07b0947e..4888d0a98822b 100644 --- a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/README_EN.md +++ b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/README_EN.md @@ -167,41 +167,34 @@ class Solution { #### C++ ```cpp -using ll = long long; - class Solution { public: int numberOfStableArrays(int zero, int one, int limit) { - this->limit = limit; - f = vector>>(zero + 1, vector>(one + 1, {-1, -1})); - return (dfs(zero, one, 0) + dfs(zero, one, 1)) % mod; - } - -private: - const int mod = 1e9 + 7; - int limit; - vector>> f; - - ll dfs(int i, int j, int k) { - if (i < 0 || j < 0) { - return 0; - } - if (i == 0) { - return k == 1 && j <= limit; - } - if (j == 0) { - return k == 0 && i <= limit; - } - ll& res = f[i][j][k]; - if (res != -1) { + const int mod = 1e9 + 7; + using ll = long long; + vector>> f = vector>>(zero + 1, vector>(one + 1, {-1, -1})); + auto dfs = [&](auto&& dfs, int i, int j, int k) -> ll { + if (i < 0 || j < 0) { + return 0; + } + if (i == 0) { + return k == 1 && j <= limit; + } + if (j == 0) { + return k == 0 && i <= limit; + } + ll& res = f[i][j][k]; + if (res != -1) { + return res; + } + if (k == 0) { + res = (dfs(dfs, i - 1, j, 0) + dfs(dfs, i - 1, j, 1) - dfs(dfs, i - limit - 1, j, 1) + mod) % mod; + } else { + res = (dfs(dfs, i, j - 1, 0) + dfs(dfs, i, j - 1, 1) - dfs(dfs, i, j - limit - 1, 0) + mod) % mod; + } return res; - } - if (k == 0) { - res = (dfs(i - 1, j, 0) + dfs(i - 1, j, 1) - dfs(i - limit - 1, j, 1) + mod) % mod; - } else { - res = (dfs(i, j - 1, 0) + dfs(i, j - 1, 1) - dfs(i, j - limit - 1, 0) + mod) % mod; - } - return res; + }; + return (dfs(dfs, zero, one, 0) + dfs(dfs, zero, one, 1)) % mod; } }; ``` @@ -250,6 +243,41 @@ func numberOfStableArrays(zero int, one int, limit int) int { } ``` +#### TypeScript + +```ts +function numberOfStableArrays(zero: number, one: number, limit: number): number { + const mod = 1e9 + 7; + const f: number[][][] = Array.from({ length: zero + 1 }, () => + Array.from({ length: one + 1 }, () => [-1, -1]), + ); + + const dfs = (i: number, j: number, k: number): number => { + if (i < 0 || j < 0) { + return 0; + } + if (i === 0) { + return k === 1 && j <= limit ? 1 : 0; + } + if (j === 0) { + return k === 0 && i <= limit ? 1 : 0; + } + let res = f[i][j][k]; + if (res !== -1) { + return res; + } + if (k === 0) { + res = (dfs(i - 1, j, 0) + dfs(i - 1, j, 1) - dfs(i - limit - 1, j, 1) + mod) % mod; + } else { + res = (dfs(i, j - 1, 0) + dfs(i, j - 1, 1) - dfs(i, j - limit - 1, 0) + mod) % mod; + } + return (f[i][j][k] = res); + }; + + return (dfs(zero, one, 0) + dfs(zero, one, 1)) % mod; +} +``` + @@ -286,16 +314,10 @@ class Solution: f[0][j][1] = 1 for i in range(1, zero + 1): for j in range(1, one + 1): - f[i][j][0] = ( - f[i - 1][j][0] - + f[i - 1][j][1] - - (0 if i - limit - 1 < 0 else f[i - limit - 1][j][1]) - ) % mod - f[i][j][1] = ( - f[i][j - 1][0] - + f[i][j - 1][1] - - (0 if j - limit - 1 < 0 else f[i][j - limit - 1][0]) - ) % mod + x = 0 if i - limit - 1 < 0 else f[i - limit - 1][j][1] + y = 0 if j - limit - 1 < 0 else f[i][j - limit - 1][0] + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x) % mod + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y) % mod return sum(f[zero][one]) % mod ``` @@ -303,37 +325,24 @@ class Solution: ```java class Solution { - private final int mod = (int) 1e9 + 7; - private Long[][][] f; - private int limit; - public int numberOfStableArrays(int zero, int one, int limit) { - f = new Long[zero + 1][one + 1][2]; - this.limit = limit; - return (int) ((dfs(zero, one, 0) + dfs(zero, one, 1)) % mod); - } - - private long dfs(int i, int j, int k) { - if (i < 0 || j < 0) { - return 0; - } - if (i == 0) { - return k == 1 && j <= limit ? 1 : 0; - } - if (j == 0) { - return k == 0 && i <= limit ? 1 : 0; + final int mod = (int) 1e9 + 7; + long[][][] f = new long[zero + 1][one + 1][2]; + for (int i = 1; i <= Math.min(zero, limit); ++i) { + f[i][0][0] = 1; } - if (f[i][j][k] != null) { - return f[i][j][k]; + for (int j = 1; j <= Math.min(one, limit); ++j) { + f[0][j][1] = 1; } - if (k == 0) { - f[i][j][k] - = (dfs(i - 1, j, 0) + dfs(i - 1, j, 1) - dfs(i - limit - 1, j, 1) + mod) % mod; - } else { - f[i][j][k] - = (dfs(i, j - 1, 0) + dfs(i, j - 1, 1) - dfs(i, j - limit - 1, 0) + mod) % mod; + for (int i = 1; i <= zero; ++i) { + for (int j = 1; j <= one; ++j) { + long x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + long y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; + } } - return f[i][j][k]; + return (int) ((f[zero][one][0] + f[zero][one][1]) % mod); } } ``` @@ -356,12 +365,10 @@ public: } for (int i = 1; i <= zero; ++i) { for (int j = 1; j <= one; ++j) { - f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - - (i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]) + mod) - % mod; - f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - - (j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]) + mod) - % mod; + ll x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + ll y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; } } return (f[zero][one][0] + f[zero][one][1]) % mod; @@ -400,6 +407,35 @@ func numberOfStableArrays(zero int, one int, limit int) int { } ``` +#### TypeScript + +```ts +function numberOfStableArrays(zero: number, one: number, limit: number): number { + const mod = 1e9 + 7; + const f: number[][][] = Array.from({ length: zero + 1 }, () => + Array.from({ length: one + 1 }, () => [0, 0]), + ); + + for (let i = 1; i <= Math.min(limit, zero); i++) { + f[i][0][0] = 1; + } + for (let j = 1; j <= Math.min(limit, one); j++) { + f[0][j][1] = 1; + } + + for (let i = 1; i <= zero; i++) { + for (let j = 1; j <= one; j++) { + const x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + const y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; + } + } + + return (f[zero][one][0] + f[zero][one][1]) % mod; +} +``` + diff --git a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution.cpp b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution.cpp index 8f5ef0950d2a2..dfee6678a0b5e 100644 --- a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution.cpp +++ b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution.cpp @@ -1,37 +1,30 @@ -using ll = long long; - class Solution { public: int numberOfStableArrays(int zero, int one, int limit) { - this->limit = limit; - f = vector>>(zero + 1, vector>(one + 1, {-1, -1})); - return (dfs(zero, one, 0) + dfs(zero, one, 1)) % mod; - } - -private: - const int mod = 1e9 + 7; - int limit; - vector>> f; - - ll dfs(int i, int j, int k) { - if (i < 0 || j < 0) { - return 0; - } - if (i == 0) { - return k == 1 && j <= limit; - } - if (j == 0) { - return k == 0 && i <= limit; - } - ll& res = f[i][j][k]; - if (res != -1) { + const int mod = 1e9 + 7; + using ll = long long; + vector>> f = vector>>(zero + 1, vector>(one + 1, {-1, -1})); + auto dfs = [&](auto&& dfs, int i, int j, int k) -> ll { + if (i < 0 || j < 0) { + return 0; + } + if (i == 0) { + return k == 1 && j <= limit; + } + if (j == 0) { + return k == 0 && i <= limit; + } + ll& res = f[i][j][k]; + if (res != -1) { + return res; + } + if (k == 0) { + res = (dfs(dfs, i - 1, j, 0) + dfs(dfs, i - 1, j, 1) - dfs(dfs, i - limit - 1, j, 1) + mod) % mod; + } else { + res = (dfs(dfs, i, j - 1, 0) + dfs(dfs, i, j - 1, 1) - dfs(dfs, i, j - limit - 1, 0) + mod) % mod; + } return res; - } - if (k == 0) { - res = (dfs(i - 1, j, 0) + dfs(i - 1, j, 1) - dfs(i - limit - 1, j, 1) + mod) % mod; - } else { - res = (dfs(i, j - 1, 0) + dfs(i, j - 1, 1) - dfs(i, j - limit - 1, 0) + mod) % mod; - } - return res; + }; + return (dfs(dfs, zero, one, 0) + dfs(dfs, zero, one, 1)) % mod; } -}; \ No newline at end of file +}; diff --git a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution.ts b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution.ts new file mode 100644 index 0000000000000..64a31af4327d8 --- /dev/null +++ b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution.ts @@ -0,0 +1,30 @@ +function numberOfStableArrays(zero: number, one: number, limit: number): number { + const mod = 1e9 + 7; + const f: number[][][] = Array.from({ length: zero + 1 }, () => + Array.from({ length: one + 1 }, () => [-1, -1]), + ); + + const dfs = (i: number, j: number, k: number): number => { + if (i < 0 || j < 0) { + return 0; + } + if (i === 0) { + return k === 1 && j <= limit ? 1 : 0; + } + if (j === 0) { + return k === 0 && i <= limit ? 1 : 0; + } + let res = f[i][j][k]; + if (res !== -1) { + return res; + } + if (k === 0) { + res = (dfs(i - 1, j, 0) + dfs(i - 1, j, 1) - dfs(i - limit - 1, j, 1) + mod) % mod; + } else { + res = (dfs(i, j - 1, 0) + dfs(i, j - 1, 1) - dfs(i, j - limit - 1, 0) + mod) % mod; + } + return (f[i][j][k] = res); + }; + + return (dfs(zero, one, 0) + dfs(zero, one, 1)) % mod; +} diff --git a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.cpp b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.cpp index 0d36a39c814d3..be0cc582cb90e 100644 --- a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.cpp +++ b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.cpp @@ -13,14 +13,12 @@ class Solution { } for (int i = 1; i <= zero; ++i) { for (int j = 1; j <= one; ++j) { - f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - - (i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]) + mod) - % mod; - f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - - (j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]) + mod) - % mod; + ll x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + ll y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; } } return (f[zero][one][0] + f[zero][one][1]) % mod; } -}; \ No newline at end of file +}; diff --git a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.java b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.java index ee73b631325c8..3aa871fd3244b 100644 --- a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.java +++ b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.java @@ -10,14 +10,12 @@ public int numberOfStableArrays(int zero, int one, int limit) { } for (int i = 1; i <= zero; ++i) { for (int j = 1; j <= one; ++j) { - f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - - (i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]) + mod) - % mod; - f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - - (j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]) + mod) - % mod; + long x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + long y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; } } return (int) ((f[zero][one][0] + f[zero][one][1]) % mod); } -} \ No newline at end of file +} diff --git a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.py b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.py index 643f1e05590f5..861592a92cc11 100644 --- a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.py +++ b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.py @@ -8,14 +8,8 @@ def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int: f[0][j][1] = 1 for i in range(1, zero + 1): for j in range(1, one + 1): - f[i][j][0] = ( - f[i - 1][j][0] - + f[i - 1][j][1] - - (0 if i - limit - 1 < 0 else f[i - limit - 1][j][1]) - ) % mod - f[i][j][1] = ( - f[i][j - 1][0] - + f[i][j - 1][1] - - (0 if j - limit - 1 < 0 else f[i][j - limit - 1][0]) - ) % mod + x = 0 if i - limit - 1 < 0 else f[i - limit - 1][j][1] + y = 0 if j - limit - 1 < 0 else f[i][j - limit - 1][0] + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x) % mod + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y) % mod return sum(f[zero][one]) % mod diff --git a/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.ts b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.ts new file mode 100644 index 0000000000000..de481edc1913a --- /dev/null +++ b/solution/3100-3199/3129.Find All Possible Stable Binary Arrays I/Solution2.ts @@ -0,0 +1,24 @@ +function numberOfStableArrays(zero: number, one: number, limit: number): number { + const mod = 1e9 + 7; + const f: number[][][] = Array.from({ length: zero + 1 }, () => + Array.from({ length: one + 1 }, () => [0, 0]), + ); + + for (let i = 1; i <= Math.min(limit, zero); i++) { + f[i][0][0] = 1; + } + for (let j = 1; j <= Math.min(limit, one); j++) { + f[0][j][1] = 1; + } + + for (let i = 1; i <= zero; i++) { + for (let j = 1; j <= one; j++) { + const x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + const y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; + } + } + + return (f[zero][one][0] + f[zero][one][1]) % mod; +} diff --git a/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/README.md b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/README.md index ed884ea3380c1..7ec6dcc5a6758 100644 --- a/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/README.md +++ b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/README.md @@ -176,41 +176,34 @@ class Solution { #### C++ ```cpp -using ll = long long; - class Solution { public: int numberOfStableArrays(int zero, int one, int limit) { - this->limit = limit; - f = vector>>(zero + 1, vector>(one + 1, {-1, -1})); - return (dfs(zero, one, 0) + dfs(zero, one, 1)) % mod; - } - -private: - const int mod = 1e9 + 7; - int limit; - vector>> f; - - ll dfs(int i, int j, int k) { - if (i < 0 || j < 0) { - return 0; - } - if (i == 0) { - return k == 1 && j <= limit; - } - if (j == 0) { - return k == 0 && i <= limit; - } - ll& res = f[i][j][k]; - if (res != -1) { + const int mod = 1e9 + 7; + using ll = long long; + vector>> f = vector>>(zero + 1, vector>(one + 1, {-1, -1})); + auto dfs = [&](auto&& dfs, int i, int j, int k) -> ll { + if (i < 0 || j < 0) { + return 0; + } + if (i == 0) { + return k == 1 && j <= limit; + } + if (j == 0) { + return k == 0 && i <= limit; + } + ll& res = f[i][j][k]; + if (res != -1) { + return res; + } + if (k == 0) { + res = (dfs(dfs, i - 1, j, 0) + dfs(dfs, i - 1, j, 1) - dfs(dfs, i - limit - 1, j, 1) + mod) % mod; + } else { + res = (dfs(dfs, i, j - 1, 0) + dfs(dfs, i, j - 1, 1) - dfs(dfs, i, j - limit - 1, 0) + mod) % mod; + } return res; - } - if (k == 0) { - res = (dfs(i - 1, j, 0) + dfs(i - 1, j, 1) - dfs(i - limit - 1, j, 1) + mod) % mod; - } else { - res = (dfs(i, j - 1, 0) + dfs(i, j - 1, 1) - dfs(i, j - limit - 1, 0) + mod) % mod; - } - return res; + }; + return (dfs(dfs, zero, one, 0) + dfs(dfs, zero, one, 1)) % mod; } }; ``` @@ -295,16 +288,10 @@ class Solution: f[0][j][1] = 1 for i in range(1, zero + 1): for j in range(1, one + 1): - f[i][j][0] = ( - f[i - 1][j][0] - + f[i - 1][j][1] - - (0 if i - limit - 1 < 0 else f[i - limit - 1][j][1]) - ) % mod - f[i][j][1] = ( - f[i][j - 1][0] - + f[i][j - 1][1] - - (0 if j - limit - 1 < 0 else f[i][j - limit - 1][0]) - ) % mod + x = 0 if i - limit - 1 < 0 else f[i - limit - 1][j][1] + y = 0 if j - limit - 1 < 0 else f[i][j - limit - 1][0] + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x) % mod + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y) % mod return sum(f[zero][one]) % mod ``` @@ -323,12 +310,10 @@ class Solution { } for (int i = 1; i <= zero; ++i) { for (int j = 1; j <= one; ++j) { - f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - - (i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]) + mod) - % mod; - f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - - (j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]) + mod) - % mod; + long x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + long y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; } } return (int) ((f[zero][one][0] + f[zero][one][1]) % mod); @@ -354,12 +339,10 @@ public: } for (int i = 1; i <= zero; ++i) { for (int j = 1; j <= one; ++j) { - f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - - (i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]) + mod) - % mod; - f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - - (j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]) + mod) - % mod; + ll x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + ll y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; } } return (f[zero][one][0] + f[zero][one][1]) % mod; @@ -398,6 +381,35 @@ func numberOfStableArrays(zero int, one int, limit int) int { } ``` +#### TypeScript + +```ts +function numberOfStableArrays(zero: number, one: number, limit: number): number { + const mod = 1e9 + 7; + const f: number[][][] = Array.from({ length: zero + 1 }, () => + Array.from({ length: one + 1 }, () => [0, 0]), + ); + + for (let i = 1; i <= Math.min(limit, zero); i++) { + f[i][0][0] = 1; + } + for (let j = 1; j <= Math.min(limit, one); j++) { + f[0][j][1] = 1; + } + + for (let i = 1; i <= zero; i++) { + for (let j = 1; j <= one; j++) { + const x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + const y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; + } + } + + return (f[zero][one][0] + f[zero][one][1]) % mod; +} +``` + diff --git a/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/README_EN.md b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/README_EN.md index 7ee1772ce1bfd..db7a668d7cdcc 100644 --- a/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/README_EN.md +++ b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/README_EN.md @@ -167,41 +167,34 @@ class Solution { #### C++ ```cpp -using ll = long long; - class Solution { public: int numberOfStableArrays(int zero, int one, int limit) { - this->limit = limit; - f = vector>>(zero + 1, vector>(one + 1, {-1, -1})); - return (dfs(zero, one, 0) + dfs(zero, one, 1)) % mod; - } - -private: - const int mod = 1e9 + 7; - int limit; - vector>> f; - - ll dfs(int i, int j, int k) { - if (i < 0 || j < 0) { - return 0; - } - if (i == 0) { - return k == 1 && j <= limit; - } - if (j == 0) { - return k == 0 && i <= limit; - } - ll& res = f[i][j][k]; - if (res != -1) { + const int mod = 1e9 + 7; + using ll = long long; + vector>> f = vector>>(zero + 1, vector>(one + 1, {-1, -1})); + auto dfs = [&](auto&& dfs, int i, int j, int k) -> ll { + if (i < 0 || j < 0) { + return 0; + } + if (i == 0) { + return k == 1 && j <= limit; + } + if (j == 0) { + return k == 0 && i <= limit; + } + ll& res = f[i][j][k]; + if (res != -1) { + return res; + } + if (k == 0) { + res = (dfs(dfs, i - 1, j, 0) + dfs(dfs, i - 1, j, 1) - dfs(dfs, i - limit - 1, j, 1) + mod) % mod; + } else { + res = (dfs(dfs, i, j - 1, 0) + dfs(dfs, i, j - 1, 1) - dfs(dfs, i, j - limit - 1, 0) + mod) % mod; + } return res; - } - if (k == 0) { - res = (dfs(i - 1, j, 0) + dfs(i - 1, j, 1) - dfs(i - limit - 1, j, 1) + mod) % mod; - } else { - res = (dfs(i, j - 1, 0) + dfs(i, j - 1, 1) - dfs(i, j - limit - 1, 0) + mod) % mod; - } - return res; + }; + return (dfs(dfs, zero, one, 0) + dfs(dfs, zero, one, 1)) % mod; } }; ``` @@ -286,16 +279,10 @@ class Solution: f[0][j][1] = 1 for i in range(1, zero + 1): for j in range(1, one + 1): - f[i][j][0] = ( - f[i - 1][j][0] - + f[i - 1][j][1] - - (0 if i - limit - 1 < 0 else f[i - limit - 1][j][1]) - ) % mod - f[i][j][1] = ( - f[i][j - 1][0] - + f[i][j - 1][1] - - (0 if j - limit - 1 < 0 else f[i][j - limit - 1][0]) - ) % mod + x = 0 if i - limit - 1 < 0 else f[i - limit - 1][j][1] + y = 0 if j - limit - 1 < 0 else f[i][j - limit - 1][0] + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x) % mod + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y) % mod return sum(f[zero][one]) % mod ``` @@ -314,12 +301,10 @@ class Solution { } for (int i = 1; i <= zero; ++i) { for (int j = 1; j <= one; ++j) { - f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - - (i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]) + mod) - % mod; - f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - - (j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]) + mod) - % mod; + long x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + long y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; } } return (int) ((f[zero][one][0] + f[zero][one][1]) % mod); @@ -345,12 +330,10 @@ public: } for (int i = 1; i <= zero; ++i) { for (int j = 1; j <= one; ++j) { - f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - - (i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]) + mod) - % mod; - f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - - (j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]) + mod) - % mod; + ll x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + ll y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; } } return (f[zero][one][0] + f[zero][one][1]) % mod; @@ -389,6 +372,35 @@ func numberOfStableArrays(zero int, one int, limit int) int { } ``` +#### TypeScript + +```ts +function numberOfStableArrays(zero: number, one: number, limit: number): number { + const mod = 1e9 + 7; + const f: number[][][] = Array.from({ length: zero + 1 }, () => + Array.from({ length: one + 1 }, () => [0, 0]), + ); + + for (let i = 1; i <= Math.min(limit, zero); i++) { + f[i][0][0] = 1; + } + for (let j = 1; j <= Math.min(limit, one); j++) { + f[0][j][1] = 1; + } + + for (let i = 1; i <= zero; i++) { + for (let j = 1; j <= one; j++) { + const x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + const y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; + } + } + + return (f[zero][one][0] + f[zero][one][1]) % mod; +} +``` + diff --git a/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution.cpp b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution.cpp index 8f5ef0950d2a2..dfee6678a0b5e 100644 --- a/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution.cpp +++ b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution.cpp @@ -1,37 +1,30 @@ -using ll = long long; - class Solution { public: int numberOfStableArrays(int zero, int one, int limit) { - this->limit = limit; - f = vector>>(zero + 1, vector>(one + 1, {-1, -1})); - return (dfs(zero, one, 0) + dfs(zero, one, 1)) % mod; - } - -private: - const int mod = 1e9 + 7; - int limit; - vector>> f; - - ll dfs(int i, int j, int k) { - if (i < 0 || j < 0) { - return 0; - } - if (i == 0) { - return k == 1 && j <= limit; - } - if (j == 0) { - return k == 0 && i <= limit; - } - ll& res = f[i][j][k]; - if (res != -1) { + const int mod = 1e9 + 7; + using ll = long long; + vector>> f = vector>>(zero + 1, vector>(one + 1, {-1, -1})); + auto dfs = [&](auto&& dfs, int i, int j, int k) -> ll { + if (i < 0 || j < 0) { + return 0; + } + if (i == 0) { + return k == 1 && j <= limit; + } + if (j == 0) { + return k == 0 && i <= limit; + } + ll& res = f[i][j][k]; + if (res != -1) { + return res; + } + if (k == 0) { + res = (dfs(dfs, i - 1, j, 0) + dfs(dfs, i - 1, j, 1) - dfs(dfs, i - limit - 1, j, 1) + mod) % mod; + } else { + res = (dfs(dfs, i, j - 1, 0) + dfs(dfs, i, j - 1, 1) - dfs(dfs, i, j - limit - 1, 0) + mod) % mod; + } return res; - } - if (k == 0) { - res = (dfs(i - 1, j, 0) + dfs(i - 1, j, 1) - dfs(i - limit - 1, j, 1) + mod) % mod; - } else { - res = (dfs(i, j - 1, 0) + dfs(i, j - 1, 1) - dfs(i, j - limit - 1, 0) + mod) % mod; - } - return res; + }; + return (dfs(dfs, zero, one, 0) + dfs(dfs, zero, one, 1)) % mod; } -}; \ No newline at end of file +}; diff --git a/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.cpp b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.cpp index 0d36a39c814d3..be0cc582cb90e 100644 --- a/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.cpp +++ b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.cpp @@ -13,14 +13,12 @@ class Solution { } for (int i = 1; i <= zero; ++i) { for (int j = 1; j <= one; ++j) { - f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - - (i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]) + mod) - % mod; - f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - - (j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]) + mod) - % mod; + ll x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + ll y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; } } return (f[zero][one][0] + f[zero][one][1]) % mod; } -}; \ No newline at end of file +}; diff --git a/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.java b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.java index ee73b631325c8..3aa871fd3244b 100644 --- a/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.java +++ b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.java @@ -10,14 +10,12 @@ public int numberOfStableArrays(int zero, int one, int limit) { } for (int i = 1; i <= zero; ++i) { for (int j = 1; j <= one; ++j) { - f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - - (i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]) + mod) - % mod; - f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - - (j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]) + mod) - % mod; + long x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + long y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; } } return (int) ((f[zero][one][0] + f[zero][one][1]) % mod); } -} \ No newline at end of file +} diff --git a/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.py b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.py index 643f1e05590f5..861592a92cc11 100644 --- a/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.py +++ b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.py @@ -8,14 +8,8 @@ def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int: f[0][j][1] = 1 for i in range(1, zero + 1): for j in range(1, one + 1): - f[i][j][0] = ( - f[i - 1][j][0] - + f[i - 1][j][1] - - (0 if i - limit - 1 < 0 else f[i - limit - 1][j][1]) - ) % mod - f[i][j][1] = ( - f[i][j - 1][0] - + f[i][j - 1][1] - - (0 if j - limit - 1 < 0 else f[i][j - limit - 1][0]) - ) % mod + x = 0 if i - limit - 1 < 0 else f[i - limit - 1][j][1] + y = 0 if j - limit - 1 < 0 else f[i][j - limit - 1][0] + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x) % mod + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y) % mod return sum(f[zero][one]) % mod diff --git a/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.ts b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.ts new file mode 100644 index 0000000000000..de481edc1913a --- /dev/null +++ b/solution/3100-3199/3130.Find All Possible Stable Binary Arrays II/Solution2.ts @@ -0,0 +1,24 @@ +function numberOfStableArrays(zero: number, one: number, limit: number): number { + const mod = 1e9 + 7; + const f: number[][][] = Array.from({ length: zero + 1 }, () => + Array.from({ length: one + 1 }, () => [0, 0]), + ); + + for (let i = 1; i <= Math.min(limit, zero); i++) { + f[i][0][0] = 1; + } + for (let j = 1; j <= Math.min(limit, one); j++) { + f[0][j][1] = 1; + } + + for (let i = 1; i <= zero; i++) { + for (let j = 1; j <= one; j++) { + const x = i - limit - 1 < 0 ? 0 : f[i - limit - 1][j][1]; + const y = j - limit - 1 < 0 ? 0 : f[i][j - limit - 1][0]; + f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j][1] - x + mod) % mod; + f[i][j][1] = (f[i][j - 1][0] + f[i][j - 1][1] - y + mod) % mod; + } + } + + return (f[zero][one][0] + f[zero][one][1]) % mod; +}