feat: add swift implementation to lcof2 problem: No.085 (#3470)

doocs · Sep 2, 2024 · d7c998a · d7c998a
1 parent adf71ed
commit d7c998a
Show file tree

Hide file tree

Showing 2 changed files with 45 additions and 0 deletions.
diff --git a/lcof2/剑指 Offer II 085. 生成匹配的括号/README.md b/lcof2/剑指 Offer II 085. 生成匹配的括号/README.md
@@ -188,6 +188,31 @@ var generateParenthesis = function (n) {
 };
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func generateParenthesis(_ n: Int) -> [String] {
+        var ans = [String]()
+        dfs(0, 0, n, "", &ans)
+        return ans
+    }
+
+    private func dfs(_ left: Int, _ right: Int, _ n: Int, _ t: String, _ ans: inout [String]) {
+        if left == n && right == n {
+            ans.append(t)
+            return
+        }
+        if left < n {
+            dfs(left + 1, right, n, t + "(", &ans)
+        }
+        if right < left {
+            dfs(left, right + 1, n, t + ")", &ans)
+        }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

diff --git a/lcof2/剑指 Offer II 085. 生成匹配的括号/Solution.swift b/lcof2/剑指 Offer II 085. 生成匹配的括号/Solution.swift
@@ -0,0 +1,20 @@
+class Solution {
+    func generateParenthesis(_ n: Int) -> [String] {
+        var ans = [String]()
+        dfs(0, 0, n, "", &ans)
+        return ans
+    }
+
+    private func dfs(_ left: Int, _ right: Int, _ n: Int, _ t: String, _ ans: inout [String]) {
+        if left == n && right == n {
+            ans.append(t)
+            return
+        }
+        if left < n {
+            dfs(left + 1, right, n, t + "(", &ans)
+        }
+        if right < left {
+            dfs(left, right + 1, n, t + ")", &ans)
+        }
+    }
+}