1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-03-15 16:52:23 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
leetcode-problemset/leetcode-cn/problem (Chinese)/等价多米诺骨牌对的数量 [number-of-equivalent-domino-pairs].html

32 lines
1.1 KiB
HTML
Raw Normal View History

2025-01-09 20:29:41 +08:00
<p>给你一组多米诺骨牌 <code>dominoes</code></p>
2022-03-27 20:37:52 +08:00
2025-01-09 20:29:41 +08:00
<p>形式上,<code>dominoes[i] = [a, b]</code><code>dominoes[j] = [c, d]</code> <strong>等价</strong> 当且仅当 (<code>a == c</code><code>b == d</code>) 或者 (<code>a == d</code><code>b == c</code>) 。即一张骨牌可以通过旋转 <code>0</code>&nbsp;度或 <code>180</code> 度得到另一张多米诺骨牌。</p>
2022-03-27 20:37:52 +08:00
<p>&nbsp;<code>0 &lt;= i &lt; j &lt; dominoes.length</code>&nbsp;的前提下,找出满足&nbsp;<code>dominoes[i]</code>&nbsp;<code>dominoes[j]</code>&nbsp;等价的骨牌对 <code>(i, j)</code> 的数量。</p>
<p>&nbsp;</p>
2025-01-09 20:29:41 +08:00
<p><strong>示例 1</strong></p>
2022-03-27 20:37:52 +08:00
2025-01-09 20:29:41 +08:00
<pre>
<strong>输入:</strong>dominoes = [[1,2],[2,1],[3,4],[5,6]]
2022-03-27 20:37:52 +08:00
<strong>输出:</strong>1
</pre>
2025-01-09 20:29:41 +08:00
<p><strong>示例 2</strong></p>
<pre>
<strong>输入:</strong>dominoes = [[1,2],[1,2],[1,1],[1,2],[2,2]]
<strong>输出:</strong>3
</pre>
2022-03-27 20:37:52 +08:00
<p>&nbsp;</p>
<p><strong>提示:</strong></p>
<ul>
2025-01-09 20:29:41 +08:00
<li><code>1 &lt;= dominoes.length &lt;= 4 * 10<sup>4</sup></code></li>
<li><code>dominoes[i].length == 2</code></li>
2022-03-27 20:37:52 +08:00
<li><code>1 &lt;= dominoes[i][j] &lt;= 9</code></li>
</ul>