LeetCode/LintCode 刷题
a minute read (About 133 words)

[easy] 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.

思路

root == null时深度为0;最大深度为左/右的最大深度+1;

代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int maxDepth(TreeNode root) {
        if(root == null) return 0;
        if(root.left == null && root.right == null) return 1;
        int DL = maxDepth(root.left);
        int DR = maxDepth(root.right);
        return (DL>DR?DL:DR)+1;
        
    }
}

链接

https://leetcode.com/problems/maximum-depth-of-binary-tree/

# 二叉树
[easy]Move Zeroes
[easy]Sum of Two Integers
Follow

Categories

Tag Cloud

Alertmanager Elasticsearch Luecne Nintendo Switch PSV PayPal VS Code blog calibre docker java nvm prometheus, zsh 二叉树 位运算 双指针 堆 持续集成 方根书简 栈 群晖 链表

Recent

Archives

Tags

Alertmanager 1
Elasticsearch 1
Luecne 1
Nintendo Switch 1
PSV 1
PayPal 1
VS Code 1
blog 1
calibre 1
docker 3
java 2
nvm 1
prometheus, 1
zsh 1
二叉树 2
位运算 2
双指针 1
堆 1
持续集成 1
方根书简 1
栈 1
群晖 1
链表 2

Recent

Archives

Tags

Alertmanager 1
Elasticsearch 1
Luecne 1
Nintendo Switch 1
PSV 1
PayPal 1
VS Code 1
blog 1
calibre 1
docker 3
java 2
nvm 1
prometheus, 1
zsh 1
二叉树 2
位运算 2
双指针 1
堆 1
持续集成 1
方根书简 1
栈 1
群晖 1
链表 2
Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×