摘要：
题目 力扣-剑指 Offer 07. 重建二叉树 输入某二叉树的前序遍历和中序遍历的结果，请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。 例如，给出 前序遍历 preorder = [3,9,20,15,7] 中序遍历 inorder = [9,3,15,20,7] 返回如下 阅读全文
//
function btn_donateClick() {
var DivPopup = document.getElementById('Div_popup');
var DivMasklayer = document.getElementById('div_masklayer');
DivMasklayer.style.display = 'block';
DivPopup.style.display = 'block';
var h = Div_popup.clientHeight;
with (Div_popup.style) {
marginTop = -h / 2 + 'px';
}
}
function MasklayerClick() {
var masklayer = document.getElementById('div_masklayer');
var divImg = document.getElementById("Div_popup");
masklayer.style.display = "none";
divImg.style.display = "none";
}
setTimeout(
function () {
document.getElementById('div_masklayer').onclick = MasklayerClick;
document.getElementById('btn_donate').onclick = btn_donateClick;
var a_gzw = document.getElementById("guanzhuwo");
a_gzw.href = "javascript:void(0);";
$("#guanzhuwo").attr("onclick","follow('33513f9f-ba13-e011-ac81-842b2b196315');");
}, 900);
