2017年9月19日
[LeetCode] 663. Equal Tree Partition 划分等价树
摘要： Given a binary tree with n nodes, your task is to check if it's possible to partition the tree to two trees which have the equal sum of values after r 阅读全文
posted @ 2017-09-19 10:14 Grandyang 阅读(5104) 评论(2) 推荐(0)
Fork me on GitHub