Cool
/
LeetCode
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Compare commits

base: Cool:29c55c38a9d0ef633163ed5c546a020a8881f8d1
Branches Tags
Cool:master
..
compare: Cool:1eaa8169f36d5d60ccf866b02f78895bb7da59bc
Branches Tags
Cool:master

2 Commits
29c55c38a9 ... 1eaa8169f3

Author SHA1 Message Date
Cool 1eaa8169f3 Merge remote-tracking branch 'origin/master' 2024-08-29 20:10:51 +08:00
Cool abacb92f43 2024/8/28 LeetCode Hot100 binaryTree Num543解决 2024-08-29 20:10:44 +08:00
1 changed files with 6 additions and 4 deletions
Show Stats Expand all files Collapse all files

10
src/main/java/com/cool/hot100/binary_tree/Num543.java
View File

@ -11,18 +11,20 @@ package com.cool.hot100.binary_tree;
*/ */
public class Num543 { public class Num543 {
int max=0;
public int diameterOfBinaryTree(TreeNode root) { public int diameterOfBinaryTree(TreeNode root) {
if (root == null) return 0; if (root == null) return 0;
int left = getTreeDeep(root.left); int left = getTreeDeep(root.left);
int right = getTreeDeep(root.right); int right = getTreeDeep(root.right);
return left + right; return Math.max(max,left+right);
} }
private int getTreeDeep(TreeNode root) { private int getTreeDeep(TreeNode root) {
if (root == null) return 0; if (root == null) return 0;
int res = getTreeDeep(root.left); int left = getTreeDeep(root.left);
res = Math.max(res, getTreeDeep(root.right)); int right=getTreeDeep(root.right);
return res + 1; max = Math.max(max,left+right );
return Math.max(left,right)+1;
} }
} }