1/**2* Definition for binary tree3* public class TreeNode {4* int val;5* TreeNode left;6* TreeNode right;7* TreeNode(int x) { val = x; }8* }9*/10publicclassSolution {11publicTreeNode sortedArrayToBST(int[] num)
TreeNode* sortedArrayToBST(vector<int>& nums,intstart,intend){if(start > end)returnnullptr;intmid = (start + end) /2; TreeNode*root =newTreeNode(nums[mid]); root->left = sortedArrayToBST(nums, start, mid -1); root->right = sortedArrayToBST(nums, mid +1, end);returnroot; } ...
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees ofeverynode never differ by more than 1. Example: Given the sorted array:...
思路很简单,用二分法,每次选中间的点作为根结点,用左、右结点递归。 TreeNode* sortedArrayToBST(vector<int> &num) {returnsortedArrayToBST(num.begin(), num.end()); } template<typename RandomAccessIterator>TreeNode*sortedArrayToBST(RandomAccessIterator first, RandomAccessIterator last) {constauto leng...
四、代码实现 classSolution{publicTreeNodesortedArrayToBST(int[] nums){return sort(nums,, nums.length -1);}publicTreeNodesort(int[] nums,int start,int end){if(start > end)returnnull;intmid=(start + end)/2;// nums数组的寻找中心点TreeNodenode=newTreeNode(nums[mid]); node.left = ...
Given an integer arraynumswhere the elements are sorted inascending order, convertit to aheight-balancedbinary search tree. Example 1: Input:nums = [-10,-3,0,5,9]Output:[0,-3,9,-10,null,5]Explanation:[0,-10,5,null,-3,null,9] is also accepted: ...
* struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: TreeNode* sortedArrayToBST(vector<int>& nums) { return helper(nums, 0, nums.size()-1); } TreeNode* helper(ve...
https://leetcode.com/problems/squares-of-a-sorted-array/ 3. Pattern: Fast & Slow pointers,快慢指针类型 这种模式,有一个非常出门的名字,叫龟兔赛跑。咱们肯定都知道龟兔赛跑啦。但还是再解释一下快慢指针:这种算法的两个指针的在数组上(或是链表上,序列上)的移动速度不一样。还别说,这种方法在解决有环...
0538 Convert BST to Greater Tree Go 67.3% Medium 0539 Minimum Time Difference 56.3% Medium 0540 Single Element in a Sorted Array Go 58.5% Medium 0541 Reverse String II Go 50.5% Easy 0542 01 Matrix Go 44.1% Medium 0543 Diameter of Binary Tree Go 55.9% Easy 0544 Output Contest Mat...
450 Delete Node in a BST Medium go 455 Assign Cookies Easy Go 457 Circular Array Loop Medium Go 489 Robot Room Cleaner 🔒 Hard Go 490 The Maze 🔒 Medium Go 496 Next Greater Element I Easy Go 509 Fibonacci Number Easy Go 541 Reverse String II Easy Go 547 Number of Provinces Medium ...