【LeetCode 543】Diameter of Binary Tree

题目描述

Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.

Example:

Given a binary tree
          1
         / \
        2   3
       / \     
      4   5    
Return 3, which is the length of the path [4,2,1,3] or [5,2,1,3].

Note: The length of path between two nodes is represented by the number of edges between them.

思路：

任意结点的左右子树深度和+1的最大值。

代码

/**
 * 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 diameterOfBinaryTree(TreeNode* root) {
        if (root == NULL) return 0;
        dfs(root);
        return ans_-1;
    }
    
    int dfs(TreeNode* root) {
        if (root == NULL) return 0;
        if (mp[root]) return mp[root];
        int left = dfs(root->left);
        int right = dfs(root->right);
        ans_ = max(ans_, left+right+1);
        mp[root] = max(left, right) + 1;
        return mp[root];
    }
private:
     int ans_ = 0;
     unordered_map<TreeNode*, int> mp;
};