您當(dāng)前位置：首頁(yè) > php開(kāi)源 > php教程 > [置頂] 【LeetCode】100. Same Tree 解題報(bào)告

[置頂] 【LeetCode】100. Same Tree 解題報(bào)告

來(lái)源：程序員人生發(fā)布時(shí)間：2016-06-04 16:07:36 閱讀次數(shù)：2669次

轉(zhuǎn)載請(qǐng)注明出處：http://blog.csdn.net/crazy1235/article/details/51541570

Subject

出處：https://leetcode.com/problems/same-tree/

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

Explain

判斷兩個(gè)2叉樹(shù)是不是1樣（結(jié)構(gòu)1樣，每一個(gè)對(duì)應(yīng)的結(jié)點(diǎn)的值也是1樣）。

Solution

solution 1

遞歸遍歷

    /**
     * 0ms
     * 
     * @param p
     * @param q
     * @return
     */
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if (p == null & q == null) {
            return true;
        }
        if (p == null || q == null) {
            return false;
        }
        if (p.val == q.val) {
            return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
        } else {
            return false;
        }
    }

方法簡(jiǎn)單死了~

solution 2

https://leetcode.com/discuss/69708/one-line-java-solution

public boolean isSameTree2(TreeNode p, TreeNode q) {
        return (p != null && q != null && p.val == q.val
                && isSameTree2(p.left, q.left) && isSameTree2(p.right, q.right))
                || (p == null && q == null);
    }