一、
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p == null && q != null) { //q、p不同,则直接返回false
return false;
}
if(p != null && q == null) { //同上
return false;
}
if(p == null && q == null) { //相同则返回true
return true;
}
if(p.val != q.val) { //值不同的话也返回false
return false;
}
return isSameTree(p.left,q.left) &&
isSameTree(p.right,q.right); //分别验证左右子树是否与另一个树相同
}
二、
public boolean isSame(TreeNode s,TreeNode t){ //检查两棵树是否相同
if(s==null&&t==null){
return true;
}
if((s!=null&&t==null)||(s==null&&t!=null)){
return false;
}
if(s.val!=t.val){
return false;
}
return (s.val==t.val)&&isSame(s.left,t.left)&&isSame(s.right,t.right);
}
public boolean isSubtree(TreeNode s, TreeNode t) {
if(s == null){
return false;
}
return isSame(s, t) || isSubtree(s.left, t) || isSubtree(s.right, t);
}
三、
public int maxDepth(TreeNode root) {
if(root==null){
return 0;
}
int left=maxDepth(root.left);
int right=maxDepth(root.right);
return left>right?(left+1):(right+1);
}
4、
public boolean isSym(TreeNode left,TreeNode right){
if(left==null&&right==null){
return true;
}
if((left!=null&&right==null)||(left==null&&right!=null)){
return false;
}
if(left.val!=right.val){
return false;
}
return isSym(left.left,right.right)&&isSym(left.right,right.left)&&left.val==right.val;
}
public boolean isSymmetric(TreeNode root) {
if(root==null)
return true;
return isSym(root.left,root.right);
}
5、
import java.util.Scanner;
import java.util.Stack;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while(sc.hasNext()){
char[] ch = sc.nextLine().toCharArray();
Stack<Character> st = new Stack<>();
st.push(ch[0]);
for(int i=1;i<ch.length-1;i++){
if(ch[i] == '#'){
System.out.print(st.pop()+" ");
}else{
st.push(ch[i]);
}
}
System.out.println();
}
}
}
六、
class Solution {
StringBuilder SB=new StringBuilder();
public String tree2str(TreeNode t) {
if(t==null)
return "";
help(t);
return SB.toString();
}
private void help(TreeNode t)
{
if(t==null)
return;
if(t.left==null&&t.right==null)
SB.append(t.val);
else if(t.right==null)
{
SB.append(t.val).append("(");
help(t.left);
SB.append(")");
}
else
{
SB.append(t.val).append("(");
help(t.left);
SB.append(")(");
help(t.right);
SB.append(")");
}
}
}