2017年10月11日
摘要: Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted f 阅读全文
posted @ 2017-10-11 13:33 Beserious 阅读(84) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. 阅读全文
posted @ 2017-10-11 10:41 Beserious 阅读(100) 评论(0) 推荐(0) 编辑