From f646dce52c81f708c9fa60ff7313cac5230f21a9 Mon Sep 17 00:00:00 2001
From: newdee <stebest@qq.com>
Date: Mon, 16 Sep 2019 13:45:24 +0800
Subject: [PATCH] 654.maximum_binary_tree.md

---
 654.maximum_binary_tree.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/654.maximum_binary_tree.md b/654.maximum_binary_tree.md
index 2c6bfd0..ba3e566 100644
--- a/654.maximum_binary_tree.md
+++ b/654.maximum_binary_tree.md
@@ -1,7 +1,7 @@
 [To Index](/index.md)
 ---
 # 654.Maximum Binary Tree
-难度:Easy
+难度:Medium
 > Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:
 
 The root is the maximum number in the array.