一、题目大意给你两棵二叉树root和subRoot。检验root中是否包含和subRoot具有相同结构和节点值的子树。如果存在，返回true；否则，返回false。二叉树tree的一棵子树包括tree的某个节点和这个节点的所有后代节点。tree也可以看做它自身的一棵子树。示例1：输入：root=[3,4,5,1,2],subRoot=[4,1,2]输出：true示例2：输入：root=[3,4,5,1,2,null,null,null,null,0],subRoot=[4,1,2]输出：false提示：root树上的节点数量范围是[1,2000]subRoot树上的节点数量范围是[1,1000

FAILURE:Buildfailedwithanexception.*Whatwentwrong:CouldnotcreateserviceoftypeTaskHistoryRepositoryusingTaskExecutionServices.createTaskHistoryRepository().>Timeoutwaitingtolocktaskhistorycache(/Volumes/MacUser/macbook/lab/aws/training/gradle_student_mgmt/.gradle/4.5.1/taskHistory).Itiscurrentlyinuse

FAILURE:Buildfailedwithanexception.*Whatwentwrong:CouldnotcreateserviceoftypeTaskHistoryRepositoryusingTaskExecutionServices.createTaskHistoryRepository().>Timeoutwaitingtolocktaskhistorycache(/Volumes/MacUser/macbook/lab/aws/training/gradle_student_mgmt/.gradle/4.5.1/taskHistory).Itiscurrentlyinuse