✨ Added solution to 1128

Sathish Babu · Sathish Babu · commit f2b76267cd09 · 2020-06-02T19:57:19.000+05:30
diff --git a/src/1128.Number-of-Equivalent-Domino-Pairs/README.md b/src/1128.Number-of-Equivalent-Domino-Pairs/README.md
@@ -5,11 +5,15 @@
 
 ## Description
 
+Given a list of dominoes, dominoes[i] = [a, b] is equivalent to dominoes[j] = [c, d] if and only if either (a==c and b==d), or (a==d and b==c) - that is, one domino can be rotated to be equal to another domino.
+
+Return the number of pairs (i, j) for which 0 <= i < j < dominoes.length, and dominoes[i] is equivalent to dominoes[j].
+
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: dominoes = [[1,2],[2,1],[3,4],[5,6]]
+Output: 1
 ```
 
 ## 题意
diff --git a/src/1128.Number-of-Equivalent-Domino-Pairs/Solution.go b/src/1128.Number-of-Equivalent-Domino-Pairs/Solution.go
@@ -1,5 +1,22 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(dominoes [][]int) int {
+	n := len(dominoes)
+	if n == 1 {
+		return 0
+	}
+	hash, pairs := make(map[int]int), 0
+	for _, val := range dominoes {
+		newVal := changeVal(val)
+		pairs += hash[newVal]
+		hash[newVal]++
+	}
+	return pairs
+}
+
+func changeVal(val []int) int {
+	if val[0] > val[1] {
+		val[0], val[1] = val[1], val[0]
+	}
+	return val[0]*10 + val[1]
 }
diff --git a/src/1128.Number-of-Equivalent-Domino-Pairs/Solution_test.go b/src/1128.Number-of-Equivalent-Domino-Pairs/Solution_test.go
@@ -10,12 +10,11 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs [][]int
+		expect int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase", [][]int{{1, 2}, {2, 1}, {3, 4}, {5, 6}, {2, 1}, {5, 6}, {6, 5}}, 6},
+		{"TestCase", [][]int{{1, 2}}, 0},
 	}
 
 	//	开始测试
