|
| 1 | +// Time: O(n * m) |
| 2 | +// Space: O(n * m) |
| 3 | + |
| 4 | +// dp |
| 5 | +class Solution { |
| 6 | +public: |
| 7 | + int numberOfSubmatrices(vector<vector<char>>& grid) { |
| 8 | + int result = 0; |
| 9 | + vector<vector<int>> dp1(size(grid) + 1, vector<int>(size(grid[0]) + 1)); |
| 10 | + vector<vector<int>> dp2(size(grid) + 1, vector<int>(size(grid[0]) + 1)); |
| 11 | + for (int i = 0; i < size(grid); ++i) { |
| 12 | + for (int j = 0; j < size(grid[0]); ++j) { |
| 13 | + dp1[i + 1][j + 1] = dp1[i][j + 1] + dp1[i + 1][j] - dp1[i][j] + (grid[i][j] == 'X' ? 1 : 0); |
| 14 | + dp2[i + 1][j + 1] = dp2[i][j + 1] + dp2[i + 1][j] - dp2[i][j] + (grid[i][j] == 'Y' ? 1 : 0); |
| 15 | + if (dp1[i + 1][j + 1] == dp2[i + 1][j + 1] && dp2[i + 1][j + 1] != 0) { |
| 16 | + ++result; |
| 17 | + } |
| 18 | + } |
| 19 | + } |
| 20 | + return result; |
| 21 | + } |
| 22 | +}; |
| 23 | + |
| 24 | +// Time: O(n * m) |
| 25 | +// Space: O(n * m) |
| 26 | +// dp |
| 27 | +class Solution2 { |
| 28 | +public: |
| 29 | + int numberOfSubmatrices(vector<vector<char>>& grid) { |
| 30 | + int result = 0; |
| 31 | + vector<vector<int>> dp1(size(grid), vector<int>(size(grid[0]))); |
| 32 | + vector<vector<int>> dp2(size(grid), vector<int>(size(grid[0]))); |
| 33 | + for (int i = 0; i < size(grid); ++i) { |
| 34 | + for (int j = 0; j < size(grid[0]); ++j) { |
| 35 | + if (i - 1 >= 0) { |
| 36 | + dp1[i][j] += dp1[i - 1][j]; |
| 37 | + dp2[i][j] += dp2[i - 1][j]; |
| 38 | + } |
| 39 | + if (j - 1 >= 0) { |
| 40 | + dp1[i][j] += dp1[i][j - 1]; |
| 41 | + dp2[i][j] += dp2[i][j - 1]; |
| 42 | + } |
| 43 | + if (i - 1 >= 0 && j - 1 >= 0) { |
| 44 | + dp1[i][j] -= dp1[i - 1][j - 1]; |
| 45 | + dp2[i][j] -= dp2[i - 1][j - 1]; |
| 46 | + } |
| 47 | + dp1[i][j] += (grid[i][j] == 'X' ? 1 : 0); |
| 48 | + dp2[i][j] += (grid[i][j] == 'Y' ? 1 : 0); |
| 49 | + if (dp1[i][j] == dp2[i][j] && dp2[i][j] != 0) { |
| 50 | + ++result; |
| 51 | + } |
| 52 | + } |
| 53 | + } |
| 54 | + return result; |
| 55 | + } |
| 56 | +}; |
0 commit comments