Solution1:我的答案。
显示是投机取巧啊
class MinimalBST {
public:
int buildMinimalBST(vector<int> vals) {
// write code here
double a = vals.size();
int res = log(a)/log(2.0);
return res + 1;
}
};
注意:C语言中带了计算对数的函数log(),底数是e。若计算其他底数的对数,则利用公式 l o g a b = l n b l n a log_{a}^b=\frac{ln_b}{ln_a} logab=lnalnb转化一下就好了~
Solution2:
参考网址:https://www.nowcoder.com/profile/3886832/codeBookDetail?submissionId=15623587
思路:取有序数组中间数值作为二叉搜索树的根,这样高度最小。确定根之后,递归依次确定根的左子树的根,右子树的根。。。
【重点学习基于数组递归构建二叉树】
//思路:取有序数组中间数值作为二叉搜索树的根,这样高度最小。确定根之后,递归依次确定根的左子树的根,右子树的根。。。
/*struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int data) :val(data),left(NULL),right(NULL) {}
};*/
class MinimalBST {
public:
TreeNode *buildBST(vector<int> vals,int left,int right) {
if (left > right)
return NULL;
int middle = left + (right - left)/2;
TreeNode *root = new TreeNode(vals[middle]);
root->left = buildBST(vals,left,middle-1);
root->right = buildBST(vals,middle+1,right);
return root;
}
int highBST(TreeNode *root) {
if (root == NULL)
return 0;
int left = highBST(root->left);
int right = highBST(root->right);
if (left > right)
return left + 1;
else
return right + 1;
}
int buildMinimalBST(vector<int> vals) {
// write code here
int length = vals.size();
if (length <= 0)
return 0;
TreeNode *root = buildBST(vals,0,length-1);
return highBST(root);
}
};
运用了两次递归,这代码写得好哇~