leetcode第一刷_Convert Sorted Array to Binary Search Tree
LeetCode to Array Tree 第一 search Binary sorted
2023-09-11 14:14:42 时间
晕。竟然另一样的一道题。换成sorted array的话。找到中间位置更加方便了。
TreeNode *sortTree(vector<int> &num, int start, int len){ if(len <= 0) return NULL; int middle = len/2; TreeNode *root = new TreeNode(num[start+middle]); root->left = sortTree(num, start, middle); root->right = sortTree(num, start+middle+1, len-middle-1); } class Solution { public: TreeNode *sortedArrayToBST(vector<int> &num) { return sortTree(num, 0, num.size()); } };
相关文章
- Leetcode: Shortest Way to Form String
- Leetcode: Hamming Distance
- Leetcode: First Bad Version
- Leetcode: Best Time to Buy and Sell Stock IV
- Leetcode: Longest Common Prefix
- LeetCode 6-10 题 详解 Java版 ( 万字 图文详解 LeetCode 算法题6-10 =====>>> <建议收藏>)
- LeetCode高频题:请你打印int数字x的所有全排列,x只包含且必须包含1-9的每一个数字
- Leetcode 130. 被围绕的区域(中等)
- 我的2016_To Code or Not to Code: No Question
- [LeetCode] Convert Sorted Array to Binary Search Tree
- 【leetcode】力扣 --- 日积月累,每日一题——3 寻找两个正序数组的中位数
- 【LeetCode】338. Counting Bits (2 solutions)
- 【LeetCode】8. String to Integer (atoi)
- Candy [leetcode] O(n)时间复杂度,O(1)空间复杂度的方法
- [LeetCode] 1017. Convert to Base -2 负二进制转换
- [LeetCode] 960. Delete Columns to Make Sorted III 删除列使其有序之三
- [LeetCode] 903. Valid Permutations for DI Sequence DI序列的有效排列
- [LeetCode] 881. Boats to Save People 渡人的船
- [LeetCode] Stickers to Spell Word 贴片拼单词
- [LeetCode] 538. Convert BST to Greater Tree 将二叉搜索树BST转为较大树
- [LeetCode] 278. First Bad Version 第一个坏版本
- Leetcode——21. Merge Two Sorted Lists