Add solution and test-cases for problem 790

Author: Cori1109

leetcode/701-800/0790.Domino-and-Tromino-Tiling/README.md

@@ -1,28 +1,31 @@
 # [790.Domino and Tromino Tiling][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+You have two types of tiles: a 2 x 1 domino shape and a tromino shape. You may rotate these shapes.  
+
+![shape](./lc-domino.jpg)
+
+Given an integer n, return the number of ways to tile an `2 x n` board. Since the answer may be very large, return it **modulo** 10<sup>9</sup> + 7.
+
+In a tiling, every square must be covered by a tile. Two tilings are different if and only if there are two 4-directionally adjacent cells on the board such that exactly one of the tilings has both squares occupied by a tile.
 
-**Example 1:**
+**Example 1:**  
+
+![example1](./lc-domino1.jpg)
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: n = 3
+Output: 5
+Explanation: The five different ways are show above.
 ```
 
-## 题意
-> ...
 
-## 题解
+**Example 2:**
 
-### 思路1
-> ...
-Domino and Tromino Tiling
-```go
 ```
-
+Input: n = 1
+Output: 1
+```
 
 ## 结语
 

leetcode/701-800/0790.Domino-and-Tromino-Tiling/Solution.go

@@ -1,5 +1,25 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+const mod790 = 1000000007
+
+func Solution(n int) int {
+	if n == 1 {
+		return 1
+	}
+	if n == 2 {
+		return 2
+	}
+	dp := make([][]int, n+1)
+	for i := 0; i < n+1; i++ {
+		dp[i] = make([]int, 3)
+	}
+	dp[1][0], dp[1][1], dp[1][2] = 1, 0, 0
+	dp[2][0], dp[2][1], dp[2][2] = 2, 1, 1
+
+	for i := 3; i <= n; i++ {
+		dp[i][0] = (dp[i-1][0] + dp[i-2][0] + dp[i-1][1] + dp[i-1][2]) % mod790
+		dp[i][1] = (dp[i-1][2] + dp[i-2][0]) % mod790
+		dp[i][2] = (dp[i-1][1] + dp[i-2][0]) % mod790
+	}
+	return dp[n][0]
 }

leetcode/701-800/0790.Domino-and-Tromino-Tiling/Solution_test.go

@@ -10,12 +10,13 @@ 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},
+		{"TestCase1", 1, 1},
+		{"TestCase2", 8, 258},
+		{"TestCase3", 9, 569},
+		{"TestCase4", 15, 65501},
 	}
 
 	//	开始测试
@@ -30,10 +31,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }