Merge pull request #1190 from 0xff-dev/3211

6boris · web-flow · commit 6ca1e82dac93 · 2025-05-27T20:40:06.000+08:00
Add solution and test-cases for problem 3211
diff --git a/leetcode/3201-3300/3211.Generate-Binary-Strings-Without-Adjacent-Zeros/README.md b/leetcode/3201-3300/3211.Generate-Binary-Strings-Without-Adjacent-Zeros/README.md
@@ -1,28 +1,35 @@
 # [3211.Generate Binary Strings Without Adjacent Zeros][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 are given a positive integer `n`.
+
+A binary string `x` is **valid** if all substrings of `x` of length 2 contain **at least** one `"1"`.
+
+Return all **valid** strings with length `n`, in any order.
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
-```
+Input: n = 3
+
+Output: ["010","011","101","110","111"]
 
-## 题意
-> ...
+Explanation:
 
-## 题解
+The valid strings of length 3 are: "010", "011", "101", "110", and "111".
+```
+
+**Example 2:**
 
-### 思路1
-> ...
-Generate Binary Strings Without Adjacent Zeros
-```go
 ```
+Input: n = 1
+
+Output: ["0","1"]
 
+Explanation:
+
+The valid strings of length 1 are: "0" and "1".
+```
 
 ## 结语
 
diff --git a/leetcode/3201-3300/3211.Generate-Binary-Strings-Without-Adjacent-Zeros/Solution.go b/leetcode/3201-3300/3211.Generate-Binary-Strings-Without-Adjacent-Zeros/Solution.go
@@ -1,5 +1,18 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(n int) []string {
+	var res []string
+	var dfs func(int, string, bool)
+	dfs = func(index int, cur string, isZero bool) {
+		if index == n {
+			res = append(res, cur)
+			return
+		}
+		if !isZero {
+			dfs(index+1, cur+"0", true)
+		}
+		dfs(index+1, cur+"1", false)
+	}
+	dfs(0, "", false)
+	return res
 }
diff --git a/leetcode/3201-3300/3211.Generate-Binary-Strings-Without-Adjacent-Zeros/Solution_test.go b/leetcode/3201-3300/3211.Generate-Binary-Strings-Without-Adjacent-Zeros/Solution_test.go
@@ -10,12 +10,11 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs int
+		expect []string
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", 3, []string{"010", "011", "101", "110", "111"}},
+		{"TestCase2", 1, []string{"0", "1"}},
 	}
 
 	//	开始测试
@@ -30,10 +29,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }

Original file line number	Diff line number	Diff line change
`@@ -10,12 +10,11 @@ func TestSolution(t *testing.T) {`
`10`	`10`	`// 测试用例`
`11`	`11`	`cases := []struct {`
`12`	`12`	`name string`
`13`		`- inputs bool`
`14`		`- expect bool`
	`13`	`+ inputs int`
	`14`	`+ expect []string`
`15`	`15`	`}{`
`16`		`- {"TestCase", true, true},`
`17`		`- {"TestCase", true, true},`
`18`		`- {"TestCase", false, false},`
	`16`	`+ {"TestCase1", 3, []string{"010", "011", "101", "110", "111"}},`
	`17`	`+ {"TestCase2", 1, []string{"0", "1"}},`
`19`	`18`	`}`
`20`	`19`
`21`	`20`	`// 开始测试`
`@@ -30,10 +29,10 @@ func TestSolution(t *testing.T) {`
`30`	`29`	`}`
`31`	`30`	`}`
`32`	`31`
`33`		`-// 压力测试`
	`32`	`+// 压力测试`
`34`	`33`	`func BenchmarkSolution(b *testing.B) {`
`35`	`34`	`}`
`36`	`35`
`37`		`-// 使用案列`
	`36`	`+// 使用案列`
`38`	`37`	`func ExampleSolution() {`
`39`	`38`	`}`