这题的算法我是是参考网上现成的,但是有一点不太明白,pre和root两个点的顺序不对时,为什么要选择root为错误节点,而不是pre。自己看了别人的代码又敲了一遍。如下:
public class Solution {
TreeNode mistake1 = null,mistake2 = null;
TreeNode pre = null;
public void recurse(TreeNode root){
if(root==null){
return ;
}
recurse(root.left);
if(pre!=null && pre.val>root.val){
if(mistake1==null){
mistake1 = pre;
mistake2 = root;
}
else{
mistake2 = root;
}
}
pre = root;
recurse(root.right);
}
public void recoverTree(TreeNode root) {
recurse(root);
if(mistake1!=null && mistake2!=null){
int temp = mistake1.val;
mistake1.val = mistake2.val;
mistake2.val = temp;
}
}
}