2018年10月7日
[leetcode] Increasing Order Search Tree
摘要： Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and o 阅读全文
posted @ 2018-10-07 22:35 Lin.B 阅读(132) 评论(0) 推荐(0)
[leetcode] Leaf-Similar Trees
摘要： Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence. For example, in the given t 阅读全文
posted @ 2018-10-07 19:34 Lin.B 阅读(123) 评论(0) 推荐(0)
[leetcode] Product of Array Except Self
摘要： Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except n 阅读全文
posted @ 2018-10-07 14:00 Lin.B 阅读(82) 评论(0) 推荐(0)