算法题:
- 链接:https://leetcode-cn.com/problems/maximum-depth-of-binary-tree
题目:
给定一个二叉树,找出其最大深度。
二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。
说明: 叶子节点是指没有子节点的节点。
解题:
var maxDepth = function(root) {
if (!root) {
return 0
}
const left = maxDepth(root.left)
const right = maxDepth(root.right)
return Math.max(left,right)+1
};
手写题:
解题 ```javascript function produce(base, recipe) { // your code here let newBase = JSON.parse(JSON.stringify(base)) recipe(newBase) if (compare(base,newBase)) return base return newBase } function compare(base , newBase){ if(typeof base !== typeof newBase) return false
if(typeof base !== ‘object’) { return base === newBase; } let isEqual = true
for(let key in base){ if(compare(base[key], newBase[key])) {
newBase[key] = base[key]
} else {
isEqual = false
} } return Object.keys(base).length === Object.keys(newBase).length && isEqual
}
```