leetcode-100. Same Tree

100. Same Tree

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

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

Example 1:

Input:     1         1
          / \       / \
         2   3     2   3

        [1,2,3],   [1,2,3]

Output: true

Example 2:

Input:     1         1
          /           \
         2             2

        [1,2],     [1,null,2]

Output: false

Example 3:

Input:     1         1
          / \       / \
         2   1     1   2

        [1,2,1],   [1,1,2]

Output: false

题意：给定两个二叉树，判断这两个二叉树是否完全一致

思路：肯定想到遍历判断，并不难，主要是看看能不能优化

一开始自己写了个方法，4ms，beats 33%

然后看了排名靠前的代码， 提交了一下居然用了5ms，beats 8%，，再提交，4ms，，，

又找了个宣称1ms过的非递归解法，提交了两次，5ms，，beats 8%，，，，

这判题的方法真是迷。。。。。。

速度都差不多，就只列出了方法不同的解法：

递归：

class Solution {
    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;
    }
}

非递归：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
public boolean isSameTree(TreeNode p, TreeNode q){

			if (p == null && q == null){
				return true;
			}else if (p == null || q == null){
				return false;
			}

			Stack<TreeNode> pStack = new Stack<>();
			Stack<TreeNode> qStack = new Stack<>();

			pStack.push(p);
			qStack.push(q);

			while (!(pStack.isEmpty() && qStack.isEmpty())) {
				TreeNode nq = qStack.pop();
				TreeNode np = pStack.pop();

				if (nq.val != np.val) {
					return false;
				}
				if (nq.left != null) {
					qStack.push(nq.left);
				}
				if (np.left != null) {
					pStack.push(np.left);
				}

				if (qStack.size() != pStack.size()) {
					return false;
				}

				if (nq.right != null) {
					qStack.push(nq.right);
				}
				if (np.right != null) {
					pStack.push(np.right);
				}
				if (pStack.size() != qStack.size()) {
					return false;
				}

			}

			return pStack.size() == qStack.size();
		}
}

转载于:https://www.cnblogs.com/linkcode/p/8150762.html