设计网站免费的,厦门网站综合优化贵吗,建设网站前台费用,建设工程教育网app题目链接#xff1a;108. 将有序数组转换为二叉搜索树 - 力扣#xff08;LeetCode#xff09;
取中间的数作为根节点#xff0c;左边的数递归转换#xff0c;右边的数递归转换
class Solution {
public:TreeNode *sortedArrayToBST(vectorint nums) {retur…题目链接108. 将有序数组转换为二叉搜索树 - 力扣LeetCode
取中间的数作为根节点左边的数递归转换右边的数递归转换
class Solution {
public:TreeNode *sortedArrayToBST(vectorint nums) {return build(nums, 0, nums.size() - 1);}TreeNode *build(vectorint nums, int left, int right) {if (left right)return nullptr;int root (left right) / 2;return new TreeNode(nums[root], build(nums, left, root - 1), build(nums, root 1, right));}
};
