[英]JavaScript function to print out a full binary tree
我正在嘗試制作一個JavaScript函數,該函數返回HTML的完整二進制數(最多一定位數)。
例如, full_bintree(1)
將為
/\
1 0
和full_bintree(2)
將為
/\
/ \
1 0
/ \ / \
1 01 0
和full_bintree(3)
將為
/\
/ \
/ \
/ \
/ \
1 0
/ \ / \
/ \ / \
1 0 1 0
/ \ / \ / \ / \
1 0 1 01 0 1 0
等等。
我開始制作一個函數,但是看起來很糟糕,並且我不斷意識到需要回去解決的問題。
function full_bintree(var b)
{
var retstr = "";
var nr = (2 << b) + (b - 1); // number of rows
for (var i = 0, j = nr - 1, k = 0; i < nr; ++i, --j, k += 2)
{
retstr += "<p>";
// Add leading spaces on line
for (var m = 0; m < j; ++m)
retstr += " ";
// Add backslashes or
// Add middle spaces
for (var m = 0; m < k; ++m)
retstring += " ";
// Add forward slashes
retstr += "</p>";
}
}
這是您的功能:
var logtree = function(A){
for(var i = 0; i < A.length; i++)
A[i] = A[i].join("");
A = A.join("\n");
if(typeof $ != "undefined")
$("#a").html(A);
console.log(A);
return A;
},
bintree = function(n, A, offset, lvl){
if(typeof offset == "undefined") offset = 0;
if(typeof lvl == "undefined") lvl = 0;
var width = 3 * Math.pow(2, n) - 1,
height = Math.ceil(width / 2),
mid = Math.floor(width / 2),
half = Math.ceil(height / 2),
nsub = Math.pow(2, lvl),
lim = offset + half - 1,
l = "/",
r = "\\";
if(typeof A == "undefined"){
A = [];
for(var i = 0; i < height; i++){
a = [];
for(var j = 0; j < width; j++) a.push(" ");
A[i] = a;
}
}
for(var i = offset, inc = 0; i <= lim; i++){
if(i == lim){
l = 1;
r = 0;
}
var a = 0, j = 0;
for(var j = 0; j < nsub; j++){
A[i][mid - inc + a - 1] = l;
A[i][mid + inc + a + 1] = r;
a += width + 1;
}
inc++;
}
if(n > 1)
bintree(n - 1, A, offset + height / 2, ++lvl);
return A;
};
logtree(bintree(4));
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.