2018年10月11日
leetcode543 - Diameter of Binary Tree - easy
摘要： Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path betwe 阅读全文
posted @ 2018-10-11 13:08 jasminemzy 阅读(201) 评论(0) 推荐(0)
leetcode85 - Maximal Rectangle - hard
摘要： Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. Example: Input: [ ["1","0","1"," 阅读全文
posted @ 2018-10-11 05:41 jasminemzy 阅读(185) 评论(0) 推荐(0)