2019年3月11日
[Algorithm] Tower Hopper Problem
摘要： By given an array of number, each number indicate the number of step you can move to next index: For example index = 0, value is 4, means at most you 阅读全文
posted @ 2019-03-11 22:07 Zhentiw 阅读(455) 评论(0) 推荐(0)
[Algorithm] Given the root to a binary tree, return the deepest node
摘要： By given a binary tree, and a root node, find the deepest node of this tree. We have way to create node: Way to create tree: Way to construct tree: Th 阅读全文
posted @ 2019-03-11 21:00 Zhentiw 阅读(403) 评论(0) 推荐(0)