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

Appearance settings

Latest commit

 

History

History
History
44 lines (34 loc) · 935 Bytes

File metadata and controls

44 lines (34 loc) · 935 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package Algorithms;
import Algorithms.tree.TreeNode;
public class Recover {
private TreeNode big = null;
private TreeNode small = null;
private TreeNode pre = new TreeNode(Integer.MIN_VALUE);
public void recoverTree(TreeNode root) {
if (root == null) {
return;
}
traverse(root);
int tmp = big.val;
big.val = small.val;
small.val = tmp;
}
private void traverse(TreeNode root) {
if (root == null) {
return;
}
traverse(root.left);
if (root.val < pre.val) {
if (big == null) {
big = pre;
small = root;
} else if (root.val < small.val){
small = root;
}
}
if (big == null) {
pre = root;
}
traverse(root.right);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.