-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
671.java
77 lines (73 loc) · 2.15 KB
/
671.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
__________________________________________________________________________________________________
sample 0 ms submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int findSecondMinimumValue(TreeNode root) {
if (root == null || root.left == null && root.right == null) return -1;
if (root.left.val < root.right.val) {
int findLeft = findSecondMinimumValue(root.left);
return findLeft < 0 ? root.right.val : Math.min(findLeft, root.right.val);
} else if (root.left.val > root.right.val) {
int findRight = findSecondMinimumValue(root.right);
return findRight < 0 ? root.left.val : Math.min(root.left.val, findRight);
}
int findLeft = findSecondMinimumValue(root.left);
int findRight = findSecondMinimumValue(root.right);
if (findLeft < 0 && findRight < 0) return -1;
if (findLeft < 0) return findRight;
if (findRight < 0) return findLeft;
return Math.min(findLeft, findRight);
}
}
__________________________________________________________________________________________________
sample 35236 kb submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
int min = Integer.MAX_VALUE;
int secondmin = Integer.MAX_VALUE;
boolean wasAssigned = false;
public int findSecondMinimumValue(TreeNode root) {
findSecondMinimumR(root);
if(!wasAssigned)
{
return -1;
}else {
return secondmin;
}
}
public void findSecondMinimumR(TreeNode root)
{
if(root == null)
{
return;
}
if(root.val < min)
{
min = root.val;
}
if(root.val > min && root.val <= secondmin)
{
secondmin = root.val;
wasAssigned = true;
}
findSecondMinimumR(root.left);
findSecondMinimumR(root.right);
}
}
__________________________________________________________________________________________________