Package g1101_1200.s1128_number_of_equivalent_domino_pairs

Class Solution

java.lang.Object

g1101_1200.s1128_number_of_equivalent_domino_pairs.Solution

public class Solution
extends Object

1128 - Number of Equivalent Domino Pairs.<p>Easy</p> <p>Given a list of <code>dominoes</code>, <code>dominoes[i] = [a, b]</code> is <strong>equivalent to</strong> <code>dominoes[j] = [c, d]</code> if and only if either (<code>a == c</code> and <code>b == d</code>), or (<code>a == d</code> and <code>b == c</code>) - that is, one domino can be rotated to be equal to another domino.</p> <p>Return <em>the number of pairs</em> <code>(i, j)</code> <em>for which</em> <code>0 <= i < j < dominoes.length</code><em>, and</em> <code>dominoes[i]</code> <em>is <strong>equivalent to</strong></em> <code>dominoes[j]</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> dominoes = [[1,2],[2,1],[3,4],[5,6]]</p> <p><strong>Output:</strong> 1</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> dominoes = [[1,2],[1,2],[1,1],[1,2],[2,2]]</p> <p><strong>Output:</strong> 3</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= dominoes.length <= 4 * 10⁴</code></li> <li><code>dominoes[i].length == 2</code></li> <li><code>1 <= dominoes[i][j] <= 9</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	numEquivDominoPairs(int[][] dominoes)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

numEquivDominoPairs

public int numEquivDominoPairs(int[][] dominoes)