Update 0108.将有序数组转换为二叉搜索树.md

添加 0108.将有序数组转换为二叉搜索树 Java版本

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：