Skip to content

feat: add swift implementation to lcp problem: No.67 #4026

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
Feb 5, 2025
Merged
Show file tree
Hide file tree
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
revert file
  • Loading branch information
klever34 committed Feb 5, 2025
commit 1913e7a7323e098ad1a93442da698df8cb9f0a96
42 changes: 42 additions & 0 deletions lcp/LCP 67. 装饰树/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -197,6 +197,48 @@ func expandBinaryTree(root *TreeNode) *TreeNode {
}
```

#### Swift

```swift
/* class TreeNode {
* var val: Int
* var left: TreeNode?
* var right: TreeNode?

* init() { self.val = 0; self.left = nil; self.right = nil }
* init(_ val: Int) { self.val = val; self.left = nil; self.right = nil }
* init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {
* self.val = val
* self.left = left
* self.right = right
* }
* }
*/

class Solution {
func expandBinaryTree(_ root: TreeNode?) -> TreeNode? {
return dfs(root)
}

private func dfs(_ root: TreeNode?) -> TreeNode? {
guard let root = root else { return nil }

let leftChild = dfs(root.left)
let rightChild = dfs(root.right)

if let leftChild = leftChild {
root.left = TreeNode(-1, leftChild, nil)
}
if let rightChild = rightChild {
root.right = TreeNode(-1, nil, rightChild)
}

return root
}
}

```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
36 changes: 36 additions & 0 deletions lcp/LCP 67. 装饰树/Solution.swift
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
/* class TreeNode {
* var val: Int
* var left: TreeNode?
* var right: TreeNode?

* init() { self.val = 0; self.left = nil; self.right = nil }
* init(_ val: Int) { self.val = val; self.left = nil; self.right = nil }
* init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {
* self.val = val
* self.left = left
* self.right = right
* }
* }
*/

class Solution {
func expandBinaryTree(_ root: TreeNode?) -> TreeNode? {
return dfs(root)
}

private func dfs(_ root: TreeNode?) -> TreeNode? {
guard let root = root else { return nil }

let leftChild = dfs(root.left)
let rightChild = dfs(root.right)

if let leftChild = leftChild {
root.left = TreeNode(-1, leftChild, nil)
}
if let rightChild = rightChild {
root.right = TreeNode(-1, nil, rightChild)
}

return root
}
}