1128. 等价多米诺骨牌对的数量

由于提示中说dominoes[i][j]在1~9之间，所以考虑45种可能的情况即可

class Solution {
public:
    int numEquivDominoPairs(vector<vector<int>>& dominoes) {
        int equal[45] = {0};
        int count = 0;
        for(int i = 1; i <= 9; i++){
            for(int j = i; j <= 9; j++){
                for(int k = 0; k < dominoes.size(); k++){
                    if((dominoes[k][0] == i && dominoes[k][1] == j) || (dominoes[k][1] == i && dominoes[k][0] == j))
                        equal[count]++;
                    
                }
                count++;
            }
        }
        int res = 0;
        for(int i = 0; i < 45; i++){
            res = res + (equal[i] * (equal[i] - 1) / 2);
        }
        return res;
       
    }
};