算法第三季15

01.09 字符串轮转

572.另一个输的子树

/**
 * 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 boolean isSubtree(TreeNode s, TreeNode t) {
        if(s == null || t == null) return false;
        return postSerialize(s).contains(postSerialize(t));
    }
    private String postSerialize(TreeNode root){
        StringBuilder sb = new StringBuilder();
        postSerialize(root, sb);
        return sb.toString();
    }
    private void postSerialize(TreeNode node, StringBuilder sb){
        
        if(node.left == null){
            sb.append("#!");
        }else{
            postSerialize(node.left, sb);
        }
        if(node.right == null){
            sb.append("#!");
        }else{
            postSerialize(node.right, sb);
        }
        sb.append(node.val).append("!");
    }
}