2016年1月11日
leetcode@ [129] Sum Root to Leaf Numbers (DFS)
摘要： https://leetcode.com/problems/sum-root-to-leaf-numbers/Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a n... 阅读全文
posted @ 2016-01-11 21:25 流白 阅读(178) 评论(0) 推荐(0)
leetcode@ [87] Scramble String (Dynamic Programming)
摘要： Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representatio... 阅读全文
posted @ 2016-01-11 20:37 流白 阅读(333) 评论(0) 推荐(0)