From 6d01869bbc4cdbd0034ffb1314556d9147caa132 Mon Sep 17 00:00:00 2001
From: ArthurP <gpan20020205@gmail.com>
Date: Thu, 11 Nov 2021 22:09:25 +0000
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200654.=E6=9C=80=E5=A4=A7?=
 =?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=A0=91.md=20C=E8=AF=AD=E8=A8=80=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0654.最大二叉树.md b/problems/0654.最大二叉树.md
index a4ae868a..5f012861 100644
--- a/problems/0654.最大二叉树.md
+++ b/problems/0654.最大二叉树.md
@@ -356,6 +356,35 @@ var constructMaximumBinaryTree = function (nums) {
 };
 ```
 
+## C
+```c
+struct TreeNode* traversal(int* nums, int left, int right) {
+    //若左边界大于右边界，返回NULL
+    if(left >= right)
+        return NULL;
+    
+    //找出数组中最大数坐标
+    int maxIndex = left;
+    int i;
+    for(i = left + 1; i < right; i++) {
+        if(nums[i] > nums[maxIndex])
+            maxIndex = i;
+    }
+    
+    //开辟结点
+    struct TreeNode* node = (struct TreeNode*)malloc(sizeof(struct TreeNode));
+    //将结点的值设为最大数组数组元素
+    node->val = nums[maxIndex];
+    //递归定义左孩子结点和右孩子结点
+    node->left = traversal(nums, left, maxIndex);
+    node->right = traversal(nums, maxIndex + 1, right);
+    return node;
+}
+
+struct TreeNode* constructMaximumBinaryTree(int* nums, int numsSize){
+    return traversal(nums, 0, numsSize);
+}
+```
 
 
 -----------------------