/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* dfs(vector<int>& nums,int L,int R) {
if(L>R)return nullptr;
int m=(L+R)>>1;//位运算符,表示除以2..
TreeNode*ptr=new TreeNode(nums[m]);//这一步生成新的子节点...
ptr->left=dfs(nums,L,m-1);
ptr->right=dfs(nums,m+1,R);
return ptr;
}
TreeNode* sortedArrayToBST(vector<int>& nums){
return dfs(nums,0,nums.size()-1);
}
};
面试题 04.02. 最小高度树
最新推荐文章于 2024-10-08 10:36:00 发布