2018年3月12日
leetcode 485. Max Consecutive Ones
摘要： Given a binary array, find the maximum number of consecutive 1s in this array. Example 1: Note: The input array will only contain 0 and 1. The length 阅读全文
posted @ 2018-03-12 23:20 bonelee 阅读(185) 评论(0) 推荐(0)
leetcode 104. Maximum Depth of Binary Tree
摘要： Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文
posted @ 2018-03-12 22:43 bonelee 阅读(231) 评论(0) 推荐(0)