Skip to content

leet code

539 - Maximum Depth of Binary Tree

어제 풀었던 문제이지만, static int 값을 쓸 때는 예상하지 못 한 값이 나왔지만, int로 return값을 받으니까 정상적인 결과가 나왔습니다.

 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
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */

class Solution {
public:
    int maxDepth(TreeNode* root) {
        int rslt = dfs(root, 0);
        printf("%d\n", rslt);
        return rslt;
    }

    int dfs(TreeNode* root, int cnt)
    {
        if(root==nullptr)
        {
            printf("%d\n", cnt);
            return cnt;
        }

        int left = dfs(root->left, cnt+1);
        int right = dfs(root->right, cnt+1);
        return left>right?left:right;
    }
};