Skip to content

3142. Check if Grid Satisfies Conditions 👍

  • Time: $O(mn)$
  • Space: $O(1)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
class Solution {
 public:
  bool satisfiesConditions(vector<vector<int>>& grid) {
    const int m = grid.size();
    const int n = grid[0].size();

    for (int i = 0; i + 1 < m; ++i)
      for (int j = 0; j < n; ++j)
        if (grid[i][j] != grid[i + 1][j])
          return false;

    for (int i = 0; i < m; ++i)
      for (int j = 0; j + 1 < n; ++j)
        if (grid[i][j] == grid[i][j + 1])
          return false;

    return true;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
class Solution {
  public boolean satisfiesConditions(int[][] grid) {
    final int m = grid.length;
    final int n = grid[0].length;

    for (int i = 0; i + 1 < m; ++i)
      for (int j = 0; j < n; ++j)
        if (grid[i][j] != grid[i + 1][j])
          return false;

    for (int i = 0; i < m; ++i)
      for (int j = 0; j + 1 < n; ++j)
        if (grid[i][j] == grid[i][j + 1])
          return false;

    return true;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
class Solution:
  def satisfiesConditions(self, grid: list[list[int]]) -> bool:
    m = len(grid)
    n = len(grid[0])
    return (all(grid[i][j] == grid[i + 1][j]
                for i in range(m - 1)
                for j in range(n)) and
            all(grid[i][j] != grid[i][j + 1]
                for i in range(m)
                for j in range(n - 1)))