FilesExpand file tree

 master

/

104.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

49 lines (41 loc) · 857 Bytes

 master

/

104.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

49 lines (41 loc) · 857 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

#include "stdafx.h"

#include <vector>

#include <stack>

#include <algorithm>

#include <iostream>

using namespace std;

/*

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

给定一个二叉树，找出其最大深度。

二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。

说明: 叶子节点是指没有子节点的节点。

示例：

给定二叉树 [3,9,20,null,null,15,7]，

3

/ \

9 20

/ \

15 7

返回它的最大深度 3 。

*/

//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) {

int height = 0;

if (root != nullptr)

{

height++;

int max_left = maxDepth(root->left);

int max_right = maxDepth(root->right);

height += max(max_left, max_right);

}

return height;

}

};