From 1f3b708be1cc13bce38f18faf5af2ccabd957f42 Mon Sep 17 00:00:00 2001
From: Joshua <47053655+Joshua-Lu@users.noreply.github.com>
Date: Fri, 14 May 2021 01:32:46 +0800
Subject: [PATCH] =?UTF-8?q?Update=200108.=E5=B0=86=E6=9C=89=E5=BA=8F?=
 =?UTF-8?q?=E6=95=B0=E7=BB=84=E8=BD=AC=E6=8D=A2=E4=B8=BA=E4=BA=8C=E5=8F=89?=
 =?UTF-8?q?=E6=90=9C=E7=B4=A2=E6=A0=91.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

添加 0108.将有序数组转换为二叉搜索树 Java版本
---
 ...将有序数组转换为二叉搜索树.md | 21 +++++++++++++++++++
 1 file changed, 21 insertions(+)

diff --git a/problems/0108.将有序数组转换为二叉搜索树.md b/problems/0108.将有序数组转换为二叉搜索树.md
index 12d47e6a..f3feaf7d 100644
--- a/problems/0108.将有序数组转换为二叉搜索树.md
+++ b/problems/0108.将有序数组转换为二叉搜索树.md
@@ -209,7 +209,28 @@ public:
 
 
 Java：
+```Java
+class Solution {
+    public TreeNode sortedArrayToBST(int[] nums) {
+        return sortedArrayToBST(nums, 0, nums.length);
+    }
+    
+    public TreeNode sortedArrayToBST(int[] nums, int left, int right) {
+        if (left >= right) {
+            return null;
+        }
+        if (right - left == 1) {
+            return new TreeNode(nums[left]);
+        }
+        int mid = left + (right - left) / 2;
+        TreeNode root = new TreeNode(nums[mid]);
+        root.left = sortedArrayToBST(nums, left, mid);
+        root.right = sortedArrayToBST(nums, mid + 1, right);
+        return root;
+    }
+}
 
+```
 
 Python：