Kotlin 题解 | #牛群的相似结构#

/**
 * class TreeNode(var `val`: Int) {
 *     var left: TreeNode? = null
 *     var right: TreeNode? = null
 * }
 */
object Solution {
    /**
    * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
    *
    * 
        * @param p TreeNode类 
        * @param q TreeNode类 
        * @return bool布尔型
    */
    fun isSameTree(p: TreeNode?,q: TreeNode?): Boolean  {
        // write code here
        return firstListTree(p, q)
    }

    fun firstListTree(tree1: TreeNode?, tree2: TreeNode?): Boolean {
        if(tree1 == null && tree2 == null) {
            return true
        }
        if (tree1?.`val` == tree2?.`val`) {
            return firstListTree(tree1?.left, tree2?.left) && firstListTree(tree1?.right, tree2?.right)
        } 
        return false
    }
}

简单递归判断一下两个树相不相等