108. Convert Sorted Array to Binary Search Tree(和把一个单链表转换成BST树的思想一致)
来源:互联网 发布:linux需掌握的技能 编辑:程序博客网 时间:2024/06/01 08:09
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
Subscribe to see which companies asked this question
解题思路:利用递归思想去解决,首先找到有序数组的中位数节点,即位于最中间位置的节点作为根节点,然后依次递归建立左右子树
TreeNode* sortedArrayToBST(vector<int>& nums) { int len = nums.size(); if(len <= 0) return NULL; if(len == 1) return new TreeNode(nums[0]); int mid = len / 2; TreeNode *root = new TreeNode(nums[mid]); vector<int> leftVec(nums.begin(),nums.begin() + mid); vector<int> rightVec(nums.begin() + mid + 1, nums.end()); root->left = sortedArrayToBST(leftVec); root->right = sortedArrayToBST(rightVec); return root; }
0 0
- 108. Convert Sorted Array to Binary Search Tree(和把一个单链表转换成BST树的思想一致)
- Convert Sorted Array to Binary Search Tree 把一个有序数组转换成BST @LeetCode
- Leetcode Convert Sorted Array to Binary Search Tree 有序数组转换成二叉搜索树BST
- [LeetCode]Convert Sorted Array to Binary Search Tree 将有序数组转换成BST
- leetCode 108.Convert Sorted Array to Binary Search Tree(将排序数组转换为BST) 解题思路和方法
- 高度最小的BST&&108. Convert Sorted Array to Binary Search Tree
- [leetcode]Convert Sorted Array to Balanced Binary Search Tree (BST)
- 【Leetcode】Convert Sorted Array to Binary Search Tree (BST)
- LeetCode 108. Convert Sorted Array to Binary Search Tree(数组转换为二叉搜索树)
- 108. Convert Sorted Array to Binary Search Tree(DFS)
- Leetcode 108. Convert Sorted Array to Binary Search Tree 有序数组转化BST 解题报告
- 177.Convert Sorted Array to Binary Search Tree With Minimal Height-把排序数组转换为高度最小的二叉搜索树(容易题)
- Convert Sorted Array to Binary Search Tree 将排序的数组转换为二叉搜索树
- 108. Convert Sorted Array to Binary Search Tree 有序数组转换为平衡二叉搜索树
- Convert Sorted Array to Binary Search Tree 将数组转换成二叉查找树
- 有序数组转换为平衡二叉搜索树(Convert Sorted Array to Binary Search Tree)
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Repeater 嵌套,子级Repeater获取 父级Repeater 中的值
- vs发布时所需库运行环境搭建
- js内截取字符串
- Spring MVC 测试方法
- 读书是一种修养 !
- 108. Convert Sorted Array to Binary Search Tree(和把一个单链表转换成BST树的思想一致)
- 【软件测试】软件测试用例的设计
- CoreGraphic&UIBezierPath绘图比较
- iOS-https转
- Java Memory Model work with Hardware Memory Architecture
- 如何快速定位Android APP中的关键函数?
- Microsoft Azure入门之介绍篇
- 数字在排序数组中出现的次数
- C# 获取32位和64位MAC地址