mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-26 02:00:27 +08:00
40 lines
1.5 KiB
HTML
40 lines
1.5 KiB
HTML
|
<p>给你一个下标从 <strong>0</strong> 开始、大小为 <code>n x n</code> 的整数矩阵 <code>grid</code> ，返回满足 <code>R<sub>i</sub></code><em> </em>行和<em> </em><code>C<sub>j</sub></code><em> </em>列相等的行列对<em> </em><code>(R<sub>i</sub>, C<sub>j</sub>)</code><em> </em>的数目<em>。</em></p>
|
|||
|
|
|
|||
|
|
<p>如果行和列以相同的顺序包含相同的元素（即相等的数组），则认为二者是相等的。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<p><img alt="" src="https://assets.leetcode.com/uploads/2022/06/01/ex1.jpg" style="width: 150px; height: 153px;" /></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>grid = [[3,2,1],[1,7,6],[2,7,7]]
|
|||
|
|
<strong>输出：</strong>1
|
|||
|
|
<strong>解释：</strong>存在一对相等行列对：
|
|||
|
|
- (第 2 行，第 1 列)：[2,7,7]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<p><img alt="" src="https://assets.leetcode.com/uploads/2022/06/01/ex2.jpg" style="width: 200px; height: 209px;" /></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>grid = [[3,1,2,2],[1,4,4,5],[2,4,2,2],[2,4,2,2]]
|
|||
|
|
<strong>输出：</strong>3
|
|||
|
|
<strong>解释：</strong>存在三对相等行列对：
|
|||
|
|
- (第 0 行，第 0 列)：[3,1,2,2]
|
|||
|
|
- (第 2 行, 第 2 列)：[2,4,2,2]
|
|||
|
|
- (第 3 行, 第 2 列)：[2,4,2,2]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</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>
|