题目1521:二叉树的镜像
还有一个就是最后一个元素后面不能打印空格!由于用递归打印,所以这里用一个全局变量记录打印了多少次,对最后一次特殊处理。
特别注意的是
if(tree[i] == null){ // 特别注意这里!当且仅当为空时才需要赋值!
tree[i] = new TreeNode(tmp[i]);
}
因为之后的代码预先改变了这里的值,所以如果再赋值就会出现指针问题!花了近半个小时debug这个问题!
还有一个就是最后一个元素后面不能打印空格!由于用递归打印,所以这里用一个全局变量记录打印了多少次,对最后一次特殊处理。
import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Scanner;
public class S19 {
static int loop = 0;
public static void main(String[] args) throws FileNotFoundException {
BufferedInputStream in = new BufferedInputStream(new FileInputStream("in.in"));
System.setIn(in);
Scanner cin = new Scanner(System.in);
while (cin.hasNextInt()) {
int n = cin.nextInt();
loop = n;
int[] tmp = new int[n];
for(int i=0; i<n; i++){
tmp[i] = cin.nextInt();
}
// System.out.println(Arrays.toString(tmp));
if(n == 0){
System.out.println("NULL");
continue;
}
cin.nextLine();
TreeNode[] tree = new TreeNode[n];
for(int i=0; i<n; i++){
String s = cin.nextLine();
//System.out.println(s);
String[] ss = s.split(" ");
if(tree[i] == null){ // 特别注意这里!当且仅当为空时才需要赋值!
tree[i] = new TreeNode(tmp[i]);
}
if(ss[0].equals("d")){
int left = Integer.parseInt(ss[1]);
int right = Integer.parseInt(ss[2]);
if(tree[left-1]==null)
tree[left-1] = new TreeNode(tmp[left-1]);
if(tree[right-1]==null)
tree[right-1] = new TreeNode(tmp[right-1]);
tree[i].left = tree[left-1];
tree[i].right = tree[right-1];
}else if(ss[0].equals("l")){
int left = Integer.parseInt(ss[1]);
tree[left-1] = new TreeNode(tmp[left-1]);
tree[i].left = tree[left-1];
}else if(ss[0].equals("r")){
int right = Integer.parseInt(ss[1]);
tree[right-1] = new TreeNode(tmp[right-1]);
tree[i].right = tree[right-1];
}else if(ss[0].equals("z")){
}
}
// preorder(tree[0]);
TreeNode mirrored = mirror(tree[0]);
if(mirrored != null){
preorder(mirrored);
System.out.println();
}
}
}
private static void preorder(TreeNode root) {
if(root != null){
loop--;
if(loop == 0){
System.out.print(root.val);
}else{
System.out.print(root.val + " ");
}
preorder(root.left);
preorder(root.right);
}
}
private static TreeNode mirror(TreeNode root) {
if(root == null){
return null;
}
TreeNode tmp = root.left;
root.left = mirror(root.right);
root.right = mirror(tmp);
return root;
}
public static class TreeNode{
int val;
TreeNode left, right;
public TreeNode(int val_){
val = val_;
}
}
}