leetcode104题解
来源:互联网 发布:java中的二分法 编辑:程序博客网 时间:2024/06/03 19:27
leetcode 104.Maximum Depth of Binary Tree
题目
Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
即题目要求求出二叉树的最大深度。
解题思路
因为求最大深度,所以首先考虑到DFS,对于二叉树,递归也常常被使用。对左节点和右节点做循环,就能得到最终的结果。本题就是使用了递归的DFS。
AC代码如下
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:int maxDepth(TreeNode* root) {if(root==NULL) return 0;int leftdepth=maxDepth(root->left);int rightdepth=maxDepth(root->right);return (leftdepth>rightdepth ? leftdepth:rightdepth)+1 ; }};
总结
本题leetcode难度为easy。题目本身不难,主要是有处理二叉树基本的思路。对于二叉树来说,先考虑递归能不能做,往往递归能够有效地减少代码量,而且思路也比较清晰明了。
阅读全文
0 0
- leetcode104题解
- leetcode104
- leetcode104题 题解 翻译 C语言版 Python版
- [LeetCode104]Subsets
- leetcode104&110
- LeetCode104 - Maximum Depth of Binary Tree
- LeetCode104:Maximum Depth of Binary Tree
- Leetcode104: Sum Root to Leaf Numbers
- [LeetCode104]Maximum Depth of Binary Tree
- leetcode104---Maximum Depth of Binary Tree
- leetcode104 Maximum Depth of Binary Tree
- LeetCode104—Maximum Depth of Binary Tree
- [LeetCode104]Maximum Depth of Binary Tree
- Leetcode104: Maximum Depth of Binary Tree
- leetcode104: Maximum Depth of Binary Tree
- LeetCode104:Maximum Depth of Binary Tree
- LeetCode104. Maximum Depth of Binary Tree
- leetcode104 Maximum Depth of Binary Tree
- Android网络编程基础(二)
- 设计模式——观察者模式
- Oracle进阶总结(2)
- Oracle递归查询
- 两数之和
- leetcode104题解
- Tensorflow学习路线
- android studio NDK编程(一)
- [Android开源库]搜集
- 编程第九十五天
- status 500!!!!
- Best Time to Buy and Sell Stock系列问题题解
- Redirect和Dispatcher 区别
- 李飞飞推荐:一篇文章帮你纠正十个机器学习误区