我正在尝试比较两个二进制树,以查看它们的结构和值是否相等,但是在算法中的某个时刻,当将if语句块中仅包含我想要的值时,return语句不起作用比较。 即
let a = "myVal"
let b = "myVal"
if(a = b){
return false
}
以上内容不仅适用于我要比较的变量,而且还适用于所有其他变量。
我检查了两个变量的类型和值,它们确实相等。
此外,当我在if代码块中引发错误时,当满足条件但return
语句不仅起作用时,它可以工作。
完整的代码
function compare(a, b){
if(a === null && b === null){
return true;
}
if(typeof a === 'object' && typeof b === 'object'){
// compare their structures
let aRoot = Object.keys(a);
let bRoot = Object.keys(b);
if(aRoot.length !== bRoot.length){
console.log('0')
return false; //Trees are of different structures
}
//Loop through the roots of the tree
for(let i in aRoot){
if(aRoot[i] !== bRoot[i]){
//Make sure the roots are represented with equal names
console.log('1')
return false;
}
let aValue = a[aRoot[i]];
let bValue = b[bRoot[i]];
if(typeof aValue !== typeof bValue){
console.log('2')
return false
}
if(aValue !== null && bValue !== null){
//If they are both of the same types compare their values check if they are child nodes or not
if(typeof aValue !== 'object'){
//Here's the main problem
if(aValue !== bValue){
// console.log("aValue : ", aValue, " bValue : ", bValue)
// console.log("aValue type : ", typeof aValue, " bValue type : ", typeof bValue)
return false;
}
}
else{
// console.log('a ', aValue)
compare(aValue, bValue);
}
}
}
}
return true;
}
let aNode = {val: 1, left: null, right: null, d: {val: 1, left: null, right: null, f: {val: 2, left: null, right: null}}};
let bNode = {val: 1, left: null, right: null, d: {val: 3/* This differs from aNode*/, left: null, right: null, f: {val: 2, left: null, right: null}}};
console.log(compare(aNode, bNode))
它适用于没有根节点的树,但不适用于没有根节点的树。
问题来自代码的if(aValue !== bValue)
部分。该代码块不仅返回false,而且在引发错误时也有效。
答案 0 :(得分:2)
您的递归调用... compare(aValue, bValue);
应该为return compare(aValue, bValue);
,否则您将丢失调用返回的值
function compare(a, b){
if(a === null && b === null){
return true;
}
if(typeof a === 'object' && typeof b === 'object'){
// compare their structures
let aRoot = Object.keys(a);
let bRoot = Object.keys(b);
if(aRoot.length !== bRoot.length){
console.log('0')
return false; //Trees are of different structures
}
//Loop through the roots of the tree
for(let i in aRoot){
if(aRoot[i] !== bRoot[i]){
//Make sure the roots are represented with equal names
console.log('1')
return false;
}
let aValue = a[aRoot[i]];
let bValue = b[bRoot[i]];
if(typeof aValue !== typeof bValue){
console.log('2')
return false
}
if(aValue !== null && bValue !== null){
//If they are both of the same types compare their values check if they are child nodes or not
if(typeof aValue !== 'object'){
//Here's the main problem
if(aValue !== bValue){
// console.log("aValue : ", aValue, " bValue : ", bValue)
// console.log("aValue type : ", typeof aValue, " bValue type : ", typeof bValue)
return false;
}
}
else{
// console.log('a ', aValue)
return compare(aValue, bValue);
// Check this ------^----^
}
}
}
}
return true;
}
let aNode = {val: 1, left: null, right: null, d: {val: 1, left: null, right: null, f: {val: 2, left: null, right: null}}};
let bNode = {val: 1, left: null, right: null, d: {val: 3/* This differs from aNode*/, left: null, right: null, f: {val: 2, left: null, right: null}}};
console.log(compare(aNode, bNode))
答案 1 :(得分:-2)
请您尝试一下此代码,我认为它可以解决您的问题。
/* Given two trees, return true if they are structurally identical */
int identicalTrees(node* a, node* b)
{
/*1. both empty */
if (a == NULL && b == NULL)
return 1;
/* 2. both non-empty -> compare them */
if (a != NULL && b != NULL)
{
return
(
a->data == b->data &&
identicalTrees(a->left, b->left) &&
identicalTrees(a->right, b->right)
);
}
/* 3. one empty, one not -> false */
return 0;
}
,然后将其用作:
if(identicalTrees(a, b))
cout << "Both tree are identical.";
else
cout << "Trees are not identical.";