方法1: 我的方法和lc官方解答1是一样的。其实就是把这个hard题目分成好多个小问题。时间复杂n,空间复杂n。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public void recoverTree(TreeNode root) {
List<Integer> list = new ArrayList<>();
inorder(root, list);
List<Integer> l = new ArrayList<>();
for(int i : list) l.add(i);
Collections.sort(l);
int index = 0;
for(int i = 0; i < list.size()-1; i++){
int curr = list.get(i);
int next = list.get(i+1);
if(curr > next){
index = i;
break;
}
}
int after = list.get(index);
int before = l.get(index);
recover(before, after, root);
}
public void inorder(TreeNode root, List<Integer> list){
if(root == null) return;
inorder(root.left, list);
list.add(root.val);
inorder(root.right, list);
}
public void recover(int before, int after, TreeNode root){
TreeNode first = findNode(before, root);
TreeNode last = findNode(after, root);
int temp = first.val;
first.val = last.val;
last.val = temp;
}
public TreeNode findNode(int val, TreeNode root){
if(root.val == val) return root;
if(root.left == null && root.right == null) return null;
if(root.left != null){
TreeNode left = findNode(val, root.left);
if(left != null) return left;
}
if(root.right != null){
TreeNode right = findNode(val, root.right);
if(right != null) return right;
}
return null;
}
}
方法2: 方法2包括三个方法,都是方法1的优化。方法1其实就是inorder traversal,那么我们知道遍历binary tree 有三种方式,recursion,iteration, morris。这边使用morris的话空间复杂就是1。我强烈建议,这道题目要仔细的看完官方解答所有内容,我现在是没看完,但是一定要看。
总结:
- 无