2020-11-09L 1128. 等价多米诺骨牌对的数量

 

function numEquivDominoPairs(dominoes){
    let len = dominoes.length;
    let count = 0;
    for(let i = 0; i < len; i++){
        for(let j = i+1; j < len; j++){
            let a = dominoes[i][0];
            let b = dominoes[i][1];
            let c = dominoes[j][0];
            let d = dominoes[j][1];
            if( (a==c && b == d) || (a==d && b==c) ){
                count++;
            }
        }
    }
    return count++;
}
var dominoes = [[1,2],[3,1],[1,5],[6,1]];