mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
34 lines
1.4 KiB
HTML
34 lines
1.4 KiB
HTML
|
<p>Given a <strong>0-indexed</strong> <code>n x n</code> integer matrix <code>grid</code>, <em>return the number of pairs </em><code>(R<sub>i</sub>, C<sub>j</sub>)</code><em> such that row </em><code>R<sub>i</sub></code><em> and column </em><code>C<sub>j</sub></code><em> are equal</em>.</p>
|
||
|
|
|
||
|
|
<p>A row and column pair is considered equal if they contain the same elements in the same order (i.e. an equal array).</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2022/06/01/ex1.jpg" style="width: 150px; height: 153px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> grid = [[3,2,1],[1,7,6],[2,7,7]]
|
||
|
|
<strong>Output:</strong> 1
|
||
|
|
<strong>Explanation:</strong> There is 1 equal row and column pair:
|
||
|
|
- (Row 2, Column 1): [2,7,7]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2022/06/01/ex2.jpg" style="width: 200px; height: 209px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> grid = [[3,1,2,2],[1,4,4,5],[2,4,2,2],[2,4,2,2]]
|
||
|
|
<strong>Output:</strong> 3
|
||
|
|
<strong>Explanation:</strong> There are 3 equal row and column pairs:
|
||
|
|
- (Row 0, Column 0): [3,1,2,2]
|
||
|
|
- (Row 2, Column 2): [2,4,2,2]
|
||
|
|
- (Row 3, Column 2): [2,4,2,2]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>n == grid.length == grid[i].length</code></li>
|
||
|
|
<li><code>1 <= n <= 200</code></li>
|
||
|
|
<li><code>1 <= grid[i][j] <= 10<sup>5</sup></code></li>
|
||
|
|
</ul>
|