摘要: 思路:从左下或者右上开始进行搜索,因为比如从左下开始搜索,若目标数大于此时的数,接下来只能向右搜,若小于,接着只能向上搜。若是从左上开始进行搜索,若目标数大于此时的数,会有两个方向可以走。 阅读全文
posted @ 2016-11-29 18:19 prog123 阅读(177) 评论(0) 推荐(0)
摘要: 题目大意: Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally ident 阅读全文
posted @ 2016-11-29 17:33 prog123 阅读(215) 评论(0) 推荐(0)