2023-12-09 18:42:21 +08:00
< 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 >
2022-07-29 23:59:06 +08:00
2023-12-09 18:42:21 +08:00
< 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 >
2022-07-29 23:59:06 +08:00
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-07-29 23:59:06 +08:00
< 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 >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 2:< / strong > < / p >
2022-07-29 23:59:06 +08:00
< 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 >