2017年9月14日
515. Find Largest Value in Each Tree Row(Medium)
摘要： You need to find the largest value in each row of a binary tree. Example: 阅读全文
posted @ 2017-09-14 15:59 Yancea 阅读(128) 评论(0) 推荐(0)
526. Beautiful Arrangement (Medium)
摘要： Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is constructed by these N numbers successfully if one of t 阅读全文
posted @ 2017-09-14 14:44 Yancea 阅读(139) 评论(0) 推荐(0)