From 9272063cf2627a6334cea807cd3de2e7166da1af Mon Sep 17 00:00:00 2001
From: YDLIN <1924723909@qq.com>
Date: Mon, 24 Jan 2022 16:42:47 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200654.=20=E6=9C=80=E5=A4=A7?=
 =?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=A0=91=20Swift=20=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0654.最大二叉树.md | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)

diff --git a/problems/0654.最大二叉树.md b/problems/0654.最大二叉树.md
index b4679c7d..44c74f89 100644
--- a/problems/0654.最大二叉树.md
+++ b/problems/0654.最大二叉树.md
@@ -401,6 +401,33 @@ struct TreeNode* constructMaximumBinaryTree(int* nums, int numsSize){
 }
 ```
 
+## Swift
+```swift
+func constructMaximumBinaryTree(_ nums: inout [Int]) -> TreeNode? {
+    return traversal(&nums, 0, nums.count)
+}
+
+func traversal(_ nums: inout [Int], _ left: Int, _ right: Int) -> TreeNode? {
+    if left >= right {
+        return nil
+    }
+    
+    var maxValueIndex = left
+    for i in (left + 1)..<right {
+        if nums[i] > nums[maxValueIndex] {
+            maxValueIndex = i
+        }
+    }
+    
+    let root = TreeNode(nums[maxValueIndex])
+    
+    root.left = traversal(&nums, left, maxValueIndex)
+    root.right = traversal(&nums, maxValueIndex + 1, right)
+    return root
+}
+```
+
+
 
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>