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

Commit9568033

Browse files
committed
Updated Minimum Absolute Difference in BST.java
1 parentc2cd62e commit9568033

File tree

1 file changed

+16
-18
lines changed

1 file changed

+16
-18
lines changed

‎Easy/Minimum Absolute Difference in BST.java

Lines changed: 16 additions & 18 deletions
Original file line numberDiff line numberDiff line change
@@ -14,24 +14,22 @@
1414
* }
1515
*/
1616
classSolution {
17-
intminDiff;
18-
TreeNodeprev;
19-
publicintgetMinimumDifference(TreeNoderoot) {
20-
minDiff =Integer.MAX_VALUE;
21-
prev =null;
22-
helper(root);
23-
returnminDiff;
24-
}
25-
26-
privatevoidhelper(TreeNoderoot) {
27-
if (root ==null) {
28-
return;
17+
publicintgetMinimumDifference(TreeNoderoot) {
18+
List<Integer>nodeValues =newArrayList<>();
19+
inorder(root,nodeValues);
20+
intminDifference =Integer.MAX_VALUE;
21+
for (inti =1;i <nodeValues.size();i++) {
22+
minDifference =Math.min(minDifference,nodeValues.get(i) -nodeValues.get(i -1));
23+
}
24+
returnminDifference;
2925
}
30-
helper(root.left);
31-
if (prev !=null) {
32-
minDiff =Math.min(minDiff,Math.abs(root.val -prev.val));
26+
27+
privatevoidinorder(TreeNoderoot,List<Integer>nodeValues) {
28+
if (root ==null) {
29+
return;
30+
}
31+
inorder(root.left,nodeValues);
32+
nodeValues.add(root.val);
33+
inorder(root.right,nodeValues);
3334
}
34-
prev =root;
35-
helper(root.right);
36-
}
3735
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp