feat: add solution to lc problem: No.2352

Author: thinkasany

solution/2300-2399/2352.Equal Row and Column Pairs/README.md

@@ -230,7 +230,44 @@ func equalPairs(grid [][]int) (ans int) {
 ### **TypeScript**
 
 ```ts
+function equalPairs(grid: number[][]): number {
+    const n = grid.length;
+    const g = Array.from({ length: n }, () =>
+        Array.from({ length: n }, () => 0),
+    );
+    for (let j = 0; j < n; ++j) {
+        for (let i = 0; i < n; ++i) {
+            g[i][j] = grid[j][i];
+        }
+    }
+    let ans = 0;
+    for (const row of grid) {
+        for (const col of g) {
+            ans += Number(row.toString() === col.toString());
+        }
+    }
+    return ans;
+}
+```
 
+```ts
+function equalPairs(grid: number[][]): number {
+    const n = grid.length;
+    let ans = 0;
+    for (let i = 0; i < n; ++i) {
+        for (let j = 0; j < n; ++j) {
+            let ok = 1;
+            for (let k = 0; k < n; ++k) {
+                if (grid[i][k] !== grid[k][j]) {
+                    ok = 0;
+                    break;
+                }
+            }
+            ans += ok;
+        }
+    }
+    return ans;
+}
 ```
 
 ### **...**

solution/2300-2399/2352.Equal Row and Column Pairs/README_EN.md

@@ -210,7 +210,44 @@ func equalPairs(grid [][]int) (ans int) {
 ### **TypeScript**
 
 ```ts
+function equalPairs(grid: number[][]): number {
+    const n = grid.length;
+    const g = Array.from({ length: n }, () =>
+        Array.from({ length: n }, () => 0),
+    );
+    for (let j = 0; j < n; ++j) {
+        for (let i = 0; i < n; ++i) {
+            g[i][j] = grid[j][i];
+        }
+    }
+    let ans = 0;
+    for (const row of grid) {
+        for (const col of g) {
+            ans += Number(row.toString() === col.toString());
+        }
+    }
+    return ans;
+}
+```
 
+```ts
+function equalPairs(grid: number[][]): number {
+    const n = grid.length;
+    let ans = 0;
+    for (let i = 0; i < n; ++i) {
+        for (let j = 0; j < n; ++j) {
+            let ok = 1;
+            for (let k = 0; k < n; ++k) {
+                if (grid[i][k] !== grid[k][j]) {
+                    ok = 0;
+                    break;
+                }
+            }
+            ans += ok;
+        }
+    }
+    return ans;
+}
 ```
 
 ### **...**

solution/2300-2399/2352.Equal Row and Column Pairs/Solution.ts

@@ -0,0 +1,18 @@
+function equalPairs(grid: number[][]): number {
+    const n = grid.length;
+    const g = Array.from({ length: n }, () =>
+        Array.from({ length: n }, () => 0),
+    );
+    for (let j = 0; j < n; ++j) {
+        for (let i = 0; i < n; ++i) {
+            g[i][j] = grid[j][i];
+        }
+    }
+    let ans = 0;
+    for (const row of grid) {
+        for (const col of g) {
+            ans += Number(row.toString() === col.toString());
+        }
+    }
+    return ans;
+}