3142. 判断矩阵是否满足条件.cpp

class Solution {
public:
    bool satisfiesConditions(vector<vector<int>>& grid) {
        for(int i = 0;i<grid.size();i++){
            for(int j = 0; j<grid[0].size(); j++){
                if((i+1<grid.size() && grid[i][j] != grid[i+1][j])  || (j+1 < grid[0].size() && grid[i][j] == grid[i][j+1])) return false;
            }
        }
        return true;
    }
};