【LeetCode】572.Subtree of Another Tree(Easy)解题报告

最新推荐文章于 2024-10-05 12:29:44 发布

郝春雨

最新推荐文章于 2024-10-05 12:29:44 发布

阅读量204

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/haoxiaoxiaoyu/article/details/78768715

版权

LeetCode 专栏收录该内容

183 篇文章 0 订阅

订阅专栏

【LeetCode】572.Subtree of Another Tree(Easy)解题报告

题目地址：https://leetcode.com/problems/subtree-of-another-tree/description/
题目描述：

Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node’s descendants. The tree s could also be considered as a subtree of itself.

Example1:
Given tree s:

     3
    / \
   4   5
  / \
 1   2
Given tree t:
   4 
  / \
 1   2
Return true, because t has the same structure and node values with a subtree of s.
Example2:
Given tree s:

     3
    / \
   4   5
  / \
 1   2
    /
   0
Given tree t:
   4
  / \
 1   2
Return false.

100题的简单变形。

Solution:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isSubtree(TreeNode s, TreeNode t) {
        if(s==null){
            return false;
        }
        if(treeSame(s,t)){
            return true;
        }
        return isSubtree(s.left,t) || isSubtree(s.right,t);   
    }
    public boolean treeSame(TreeNode s,TreeNode t){
        if(s==null && t==null){
            return true;
        }else if(s==null || t==null){
            return false;
        }else{
            return s.val==t.val && treeSame(s.left,t.left) && treeSame(s.right,t.right);
        }

    }
}