Fork me on GitHub
2017年2月26日
[leetcode-129-Sum Root to Leaf Numbers]
摘要： Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 whic 阅读全文
posted @ 2017-02-26 23:31 hellowOOOrld 阅读(178) 评论(0) 推荐(0)
[leetcode-143-Reorder List]
摘要： Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place without altering the nodes' values. Fo 阅读全文
posted @ 2017-02-26 14:43 hellowOOOrld 阅读(156) 评论(0) 推荐(0)