mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 11:34:46 +08:00
update: 平衡二叉树js版本格式化
This commit is contained in:
@ -610,25 +610,19 @@ var isBalanced = function(root) {
|
|||||||
// 1. 确定递归函数参数以及返回值
|
// 1. 确定递归函数参数以及返回值
|
||||||
const getDepth = function(node) {
|
const getDepth = function(node) {
|
||||||
// 2. 确定递归函数终止条件
|
// 2. 确定递归函数终止条件
|
||||||
if(node===null){
|
if(node === null) return 0;
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
// 3. 确定单层递归逻辑
|
// 3. 确定单层递归逻辑
|
||||||
let leftDepth = getDepth(node.left); //左子树高度
|
let leftDepth = getDepth(node.left); //左子树高度
|
||||||
if(leftDepth===-1){
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
let rightDepth = getDepth(node.right); //右子树高度
|
let rightDepth = getDepth(node.right); //右子树高度
|
||||||
if(rightDepth===-1){
|
if(leftDepth === -1) return -1;
|
||||||
return -1;
|
if(rightDepth === -1) return -1;
|
||||||
}
|
|
||||||
if(Math.abs(leftDepth - rightDepth) > 1) {
|
if(Math.abs(leftDepth - rightDepth) > 1) {
|
||||||
return -1;
|
return -1;
|
||||||
} else {
|
} else {
|
||||||
return 1 + Math.max(leftDepth, rightDepth);
|
return 1 + Math.max(leftDepth, rightDepth);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return getDepth(root)===-1?false:true;
|
return !(getDepth(root) === -1);
|
||||||
};
|
};
|
||||||
```
|
```
|
||||||
|
|
||||||
|
Reference in New Issue
Block a user