33import com .inuker .solution .BinaryTreeInorderTraversal ;
44import com .leetcode .library .TreeNode ;
55
6+ import java .util .LinkedList ;
67import java .util .List ;
8+ import java .util .Stack ;
79
810public class main {
911
@@ -20,16 +22,42 @@ public static void main(String[] args) {
2022 }
2123 }
2224
23- public TreeNode inorderSuccessor (TreeNode root , TreeNode p ) {
24- TreeNode node = null ;
25- while (root != null ) {
26- if (p .val < root .val ) {
27- node = root ;
28- root = root .left ;
25+ public List <Integer > closestKValues (TreeNode root , double target , int k ) {
26+ Stack <Integer > smaller = new Stack <>();
27+ Stack <Integer > larger = new Stack <>();
28+ helper (root , smaller , target , true );
29+ helper (root , larger , target , false );
30+ List <Integer > result = new LinkedList <>();
31+ for (int i = 0 ; i < k ; i ++) {
32+ if (smaller .isEmpty ()) {
33+ result .add (larger .pop ());
34+ } else if (larger .isEmpty ()) {
35+ result .add (smaller .pop ());
36+ } else if (Math .abs (smaller .peek () - target ) < Math .abs (larger .peek () - target )) {
37+ result .add (smaller .pop ());
2938 } else {
30- root = root .right ;
39+ result .add (larger .pop ());
40+ }
41+ }
42+ return result ;
43+ }
44+
45+ private void helper (TreeNode root , Stack <Integer > stack0 , double target , boolean smaller ) {
46+ Stack <TreeNode > stack = new Stack <>();
47+ while (!stack .isEmpty () || root != null ) {
48+ if (root != null ) {
49+ stack .push (root );
50+ root = smaller ? root .left : root .right ;
51+ } else {
52+ root = stack .pop ();
53+
54+ if ((smaller && root .val >= target ) || (!smaller && root .val < target )) {
55+ return ;
56+ }
57+
58+ stack0 .push (root .val );
59+ root = smaller ? root .right : root .left ;
3160 }
3261 }
33- return node ;
3462 }
3563}
0 commit comments