- 博客(2)
- 资源 (5)
- 收藏
- 关注
原创 【LeetCode】Path Sum II
题意Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.思路基本的深搜,注意一点就是必须是根到叶子节点求和,不可在非叶子节点处停。代码/** * Definition for binary tree * struct TreeNode { *
2015-04-09 16:53:49 1116
原创 'LeetCode'水题一道:Minimum Depth of Binary Tree
题意Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.思路 一般做法是深度优先遍历,分别递归左右子树,求出两边的最小距离,取较小值+
2015-04-09 16:19:37 988
android口语对话系统
2014-05-10
Django1.6_利用Form实现注册登录注销修改密码
2014-03-19
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人