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> 度或 <code>180</code> 度得到另一张多米诺骨牌。</p>
|
2022-03-27 20:37:52 +08:00
|
|
|
|
|
|
|
|
|
<p>在 <code>0 <= i < j < dominoes.length</code> 的前提下,找出满足 <code>dominoes[i]</code> 和 <code>dominoes[j]</code> 等价的骨牌对 <code>(i, j)</code> 的数量。</p>
|
|
|
|
|
|
|
|
|
|
<p> </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> </p>
|
|
|
|
|
|
|
|
|
|
<p><strong>提示:</strong></p>
|
|
|
|
|
|
|
|
|
|
<ul>
|
2025-01-09 20:29:41 +08:00
|
|
|
|
<li><code>1 <= dominoes.length <= 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 <= dominoes[i][j] <= 9</code></li>
|
|
|
|
|
</ul>
|