108. Convert Sorted Array to Binary

Author: tom4649

108/memo.md

@@ -0,0 +1,5 @@
+# 108. Convert Sorted Array to Binary Search Tree
+[リンク](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/)
+
+- sol1.py: 1分ぐらいで書けて一発で通った
+    - 再帰が一番素直な気がする

108/sol1.py

@@ -0,0 +1,16 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:
+        if not nums:
+            return None
+        idx_median = len(nums) // 2
+        return TreeNode(
+            nums[idx_median],
+            left=self.sortedArrayToBST(nums[:idx_median]),
+            right=self.sortedArrayToBST(nums[idx_median + 1 :]),
+        )