From 2706b07a974af830beb0258563efc7663636b525 Mon Sep 17 00:00:00 2001
From: ironartisan <ironerhalo@gmail.com>
Date: Thu, 12 Aug 2021 09:37:26 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A01382.=E5=B0=86=E4=BA=8C?=
 =?UTF-8?q?=E5=8F=89=E6=90=9C=E7=B4=A2=E6=A0=91=E5=8F=98=E5=B9=B3=E8=A1=A1?=
 =?UTF-8?q?java=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/1382.将二叉搜索树变平衡.md | 26 +++++++++++++++++++-
 1 file changed, 25 insertions(+), 1 deletion(-)

diff --git a/problems/1382.将二叉搜索树变平衡.md b/problems/1382.将二叉搜索树变平衡.md
index 75530663..758d5ad8 100644
--- a/problems/1382.将二叉搜索树变平衡.md
+++ b/problems/1382.将二叉搜索树变平衡.md
@@ -76,7 +76,31 @@ public:
 # 其他语言版本
 
 Java：
-
+```java
+class Solution {
+    ArrayList <Integer> res = new ArrayList<Integer>();
+    // 有序树转成有序数组
+    private void travesal(TreeNode cur) {
+            if (cur == null) return;
+            travesal(cur.left);
+            res.add(cur.val);
+            travesal(cur.right);
+        }
+    // 有序数组转成平衡二叉树
+    private TreeNode getTree(ArrayList <Integer> nums, int left, int right) {
+        if (left > right) return null;
+        int mid = left + (right - left) / 2;
+        TreeNode root = new TreeNode(nums.get(mid));
+        root.left = getTree(nums, left, mid - 1);
+        root.right = getTree(nums, mid + 1, right);
+        return root;
+    }
+    public TreeNode balanceBST(TreeNode root) {
+        travesal(root);
+        return getTree(res, 0, res.size() - 1);
+    }
+}
+```
 Python：
 ```python
 class Solution: