Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit76e8300

Browse files
refactor 530
1 parent6ef3b24 commit76e8300

File tree

2 files changed

+30
-26
lines changed

2 files changed

+30
-26
lines changed

‎src/main/java/com/fishercoder/solutions/_530.java

Lines changed: 25 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,8 @@
66
importjava.util.TreeSet;
77

88
/**
9+
* 530. Minimum Absolute Difference in BST
10+
*
911
* Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.
1012
1113
Example:
@@ -27,29 +29,31 @@
2729
*/
2830
publicclass_530 {
2931

30-
publicintgetMinimumDifference(TreeNoderoot) {
31-
TreeSet<Integer>treeset =newTreeSet<>();
32-
treeset.add(root.val);
33-
dfs(root,treeset);
34-
intdiff =Integer.MAX_VALUE;
35-
Iterator<Integer>iterator =treeset.iterator();
36-
intprev =iterator.next();
37-
while (iterator.hasNext()) {
38-
intcurrent =iterator.next();
39-
diff =Math.min(diff,Math.abs(current -prev));
40-
prev =current;
32+
publicstaticclassSolution1 {
33+
publicintgetMinimumDifference(TreeNoderoot) {
34+
TreeSet<Integer>treeset =newTreeSet<>();
35+
treeset.add(root.val);
36+
dfs(root,treeset);
37+
intdiff =Integer.MAX_VALUE;
38+
Iterator<Integer>iterator =treeset.iterator();
39+
intprev =iterator.next();
40+
while (iterator.hasNext()) {
41+
intcurrent =iterator.next();
42+
diff =Math.min(diff,Math.abs(current -prev));
43+
prev =current;
44+
}
45+
returndiff;
4146
}
42-
returndiff;
43-
}
4447

45-
privatevoiddfs(TreeNoderoot,TreeSet<Integer>treeset) {
46-
if (root.left !=null) {
47-
treeset.add(root.left.val);
48-
dfs(root.left,treeset);
49-
}
50-
if (root.right !=null) {
51-
treeset.add(root.right.val);
52-
dfs(root.right,treeset);
48+
privatevoiddfs(TreeNoderoot,TreeSet<Integer>treeset) {
49+
if (root.left !=null) {
50+
treeset.add(root.left.val);
51+
dfs(root.left,treeset);
52+
}
53+
if (root.right !=null) {
54+
treeset.add(root.right.val);
55+
dfs(root.right,treeset);
56+
}
5357
}
5458
}
5559
}

‎src/test/java/com/fishercoder/_530Test.java

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -9,14 +9,14 @@
99
importstaticjunit.framework.Assert.assertEquals;
1010

1111
publicclass_530Test {
12-
privatestatic_530test;
12+
privatestatic_530.Solution1solution1;
1313
privatestaticintexpected;
1414
privatestaticintactual;
1515
privatestaticTreeNoderoot;
1616

1717
@BeforeClass
1818
publicstaticvoidsetup() {
19-
test =new_530();
19+
solution1 =new_530.Solution1();
2020
}
2121

2222
@Before
@@ -31,7 +31,7 @@ public void test1() {
3131
root.right =newTreeNode(3);
3232
root.right.left =newTreeNode(2);
3333
expected =1;
34-
actual =test.getMinimumDifference(root);
34+
actual =solution1.getMinimumDifference(root);
3535
assertEquals(expected,actual);
3636
}
3737

@@ -41,7 +41,7 @@ public void test2() {
4141
root.right =newTreeNode(5);
4242
root.right.left =newTreeNode(3);
4343
expected =2;
44-
actual =test.getMinimumDifference(root);
44+
actual =solution1.getMinimumDifference(root);
4545
assertEquals(expected,actual);
4646
}
4747

@@ -54,7 +54,7 @@ public void test3() {
5454
root.left.right =newTreeNode(445);
5555
root.right.right =newTreeNode(699);
5656
expected =47;
57-
actual =test.getMinimumDifference(root);
57+
actual =solution1.getMinimumDifference(root);
5858
assertEquals(expected,actual);
5959
}
6060
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp