Skip to content

220407 岛屿问题 #18

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
loorr wants to merge 3 commits into
base: main
Choose a base branch
from
Open

220407 岛屿问题 #18

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
6f83d98
add
Ilene-w Apr 2, 2022
647a373
add: DiameterofBinaryTree
Ilene-w Apr 7, 2022
9dca35f
Merge branch 'main' into 220407-week2
loorr Apr 17, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 0 additions & 14 deletions algorithm-learning-common/target/classes/log4j2.xml
View file
Open in desktop

This file was deleted.

43 changes: 43 additions & 0 deletions algorithm-learning-ilene/src/main/java/com/example/ilene/DiameterofBinaryTree.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,43 @@
package com.example.ilene;

import com.example.common.TemplateCallBack;
import com.example.common.TreeNode;
import lombok.extern.slf4j.Slf4j;
import junit.framework.Assert;


/**
* 543. ��������ֱ��
* ����һ�ö�����������Ҫ��������ֱ�����ȡ�һ�ö�������ֱ�������������������·�������е����ֵ������·�����ܴ���Ҳ���ܲ���������㡣
*/
@Slf4j
public class DiameterofBinaryTree implements TemplateCallBack {
int ans = 0;
public int diameterOfBinaryTree(TreeNode root) {
sideDepth(root);
return ans;
}

public int sideDepth(TreeNode root){
if (root == null){
return 0;
}

int leftDepth = sideDepth(root.left);
int rightDepth = sideDepth(root.right);
ans = Math.max(ans, leftDepth+rightDepth);
return Math.max(leftDepth, rightDepth)+1;

}
TreeNode root1;
@Override
public void generateCase() {
Integer[] case1 = new Integer[]{1, 2, 3, 4, 5};
root1 = TreeNode.getInstance(case1);
}

@Override
public void run() {
Assert.assertEquals(3, sideDepth(root1));
}
}
14 changes: 0 additions & 14 deletions algorithm-learning-loorr/target/classes/log4j2.xml
View file
Open in desktop

This file was deleted.