822 added

Author: aQua

Algorithms/0822.card-flipping-game/README.md

@@ -0,0 +1,32 @@
+# [822. Card Flipping Game](https://leetcode.com/problems/card-flipping-game/)
+
+## 题目
+
+On a table are N cards, with a positive integer printed on the front and back of each card (possibly different).
+
+We flip any number of cards, and after we choose onecard.
+
+If the number X on the back of the chosencard is not on the front of any card, then this number X is good.
+
+What is the smallest number that is good? If no number is good, output 0.
+
+Here, fronts[i] and backs[i] represent the number on the front and back of card i.
+
+Aflip swaps the front and back numbers, so the value on the front is now on the back and vice versa.
+
+Example:
+
+Input: fronts = [1,2,4,4,7], backs = [1,3,4,1,3]
+Output: 2
+Explanation: If we flip the second card, the fronts are [1,3,4,4,7] and the backs are [1,2,4,1,3].
+We choose the second card, which has number 2 on the back, and it isn't on the front of any card, so 2 is good.
+
+Note:
+
+1. 1 <= fronts.length == backs.length<=1000.
+1. 1 <=fronts[i]<= 2000.
+1. 1 <= backs[i]<= 2000.
+
+## 解题思路
+
+见程序注释

Algorithms/0822.card-flipping-game/card-flipping-game.go

@@ -0,0 +1,6 @@
+package problem0822
+
+func flipgame(fronts []int, backs []int) int {
+    
+	return 0
+}

Algorithms/0822.card-flipping-game/card-flipping-game_test.go

@@ -0,0 +1,41 @@
+package problem0822
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	fronts []int
+	backs  []int
+	ans    int
+}{
+
+	{
+		[]int{1, 2, 4, 4, 7},
+		[]int{1, 3, 4, 1, 3},
+		2,
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_flipgame(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		ast.Equal(tc.ans, flipgame(tc.fronts, tc.backs), "输入:%v", tc)
+	}
+}
+
+func Benchmark_flipgame(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			flipgame(tc.fronts, tc.backs)
+		}
+	}
+}

leetcode.json

@@ -1,7 +1,7 @@
 {
 	"Username": "aQuaYi",
 	"Ranking": 1098,
-	"Updated": "2018-05-18T05:13:06.382625511+08:00",
+	"Updated": "2018-05-18T08:23:56.463665066+08:00",
 	"Record": {
 		"Easy": {
 			"Solved": 168,
@@ -613,7 +613,7 @@
 			"ID": 49,
 			"Title": "Group Anagrams",
 			"TitleSlug": "group-anagrams",
-			"PassRate": "38%",
+			"PassRate": "39%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -2089,7 +2089,7 @@
 			"ID": 172,
 			"Title": "Factorial Trailing Zeroes",
 			"TitleSlug": "factorial-trailing-zeroes",
-			"PassRate": "36%",
+			"PassRate": "37%",
 			"Difficulty": "Easy",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -3073,7 +3073,7 @@
 			"ID": 254,
 			"Title": "Factor Combinations",
 			"TitleSlug": "factor-combinations",
-			"PassRate": "43%",
+			"PassRate": "44%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": true,