class Solution {
public int equalPairs(int[][] grid) {
int n = grid.length;
List<int[]> rows = new ArrayList<>();
List<int[]> cols = new ArrayList<>();
//行
for (int[] row : grid) {
rows.add(row);
}
//列
for (int i = 0; i < n; i++) {
int[] col = new int[n];
for (int j = 0; j < n; j++) {
col[j] = grid[j][i];
}
cols.add(col);
}
//每一行和每一列进行比较
int ans = 0;
for (int[] row : rows) {
for (int[] col : cols) {
boolean flag = true;
for (int i = 0; i < n; i++) {
if (row[i] != col[i]) {
flag = false;
break;
}
}
if (flag) {
ans++;
}
}
}
return ans;
}
}
class Solution {
public int equalPairs(int[][] grid) {
int ans = 0;
int n = grid.length;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
boolean flag = true;
for (int k = 0; k < n; k++) {
if (grid[i][k] != grid[k][j]) {
flag = false;
break;
}
}
if (flag) {
ans++;
}
}
}
return ans;
}
}