Merge pull request #28 from hovinghuang/js-dev

update: 更新“二叉树的最大深度”题解

README.md

@@ -95,7 +95,7 @@ Windows or Linux 可以用 （CTRL + click）题目 or 题解 打开一个新窗
 | 24*| [螺旋矩阵](./src/00-codetop-fontend-100/24-spiral-matrix.ts)| 13 |  [题目](https://leetcode-cn.com/problems/spiral-matrix/) [题解](https://leetcode-cn.com/problems/spiral-matrix/solution/luo-xuan-ju-zhen-by-hovinghuang-i1if/)|  [题目](https://www.nowcoder.com/practice/7edf70f2d29c4b599693dc3aaeea1d31) [题解](https://blog.nowcoder.net/n/de3f4f8d4f504bc2b3b55ecde6295257) | `-` `-` | `medium` |
 | 25*| [最长上升子序列](./src/00-codetop-fontend-100/25-longest-increasing-subsequence.ts)| 12 |  [题目](https://leetcode-cn.com/problems/longest-increasing-subsequence/) [题解](https://leetcode-cn.com/problems/longest-increasing-subsequence/solution/by-hovinghuang-thvh/)|  [题目](https://www.nowcoder.com/practice/5164f38b67f846fb8699e9352695cd2f) [题解](https://blog.nowcoder.net/n/df338bdebd0e4101b41b1978f6f3f98a) | `动态规划` `贪心` `二分` | `medium` |
 | 26*| [二叉树的中序遍历](./src/26-binary-tree-inorder-traversal.ts)| 13 |  [题目](https://leetcode-cn.com/problems/binary-tree-inorder-traversal/) [题解](https://leetcode-cn.com/problems/binary-tree-inorder-traversal/solution/by-hovinghuang-nd38/)|  [题目](https://www.nowcoder.com/practice/0bf071c135e64ee2a027783b80bf781d) [题解](https://blog.nowcoder.net/n/e37c5bf59db341dab53094e6b43892eb) | `二叉树` `DFS` `BFS` | `easy` |
-| 27*| [二叉树的最大深度]()| 12 |  [题目]() [题解]()|  [题目]() [题解]() | `二叉树` `-` | `easy` |
+| 27*| [二叉树的最大深度](./src/00-codetop-fontend-100/27-maximum-depth-of-binary-tree.ts)| 12 |  [题目](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/) [题解](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/solution/by-hovinghuang-3sz3/)|  [题目](https://www.nowcoder.com/practice/8a2b2bf6c19b4f23a9bdb9b233eefa73) [题解](https://blog.nowcoder.net/n/b3939da0dc6f4d7792b0551539892e72) | `二叉树` `-` | `easy` |
 | 28| [岛屿的最大面积]()| 11 |  [题目]() [题解]()|  [题目]() [题解]() | `DFS` `BFS` | `medium` |
 | 29| [LRU缓存机制]()| 11 |  [题目]() [题解]()|  [题目]() [题解]() | `-` `-` | `medium` |
 | 30| [零钱兑换]()| 12 |  [题目]() [题解]()|  [题目]() [题解]() | `-` `-` | `medium` |