# 第七十六周ARTS总结

# Algorithm

Same Tree (opens new window)

0ms | 100.00% Run time
36.5MB | 49.90% Memory

public boolean isSameTree(TreeNode p, TreeNode q) {
    if (p == null || q == null) {
        if (p != null || q != null) {
            return false;
        } else {
            return true;
        }
    }

    // 思路：深度遍历
    Stack<TreeNode> pStack = new Stack<>();
    Stack<TreeNode> qStack = new Stack<>();

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

    // 左树不断入栈
    while (pStack.peek().left != null || qStack.peek().left != null) {
        if (pStack.peek().left == null || qStack.peek().left == null) {
            return false;
        }

        pStack.push(pStack.peek().left);
        qStack.push(qStack.peek().left);
    }

    while (true) {
        if (pStack.empty() && qStack.empty()) {
            return true;
        }

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

        TreeNode pTemp = pStack.pop();
        TreeNode qTemp = qStack.pop();

        if (pTemp.right != null || qTemp.right != null) {
            if (pTemp.right == null || qTemp.right == null) {
                return false;
            }

            pStack.push(pTemp.right);
            qStack.push(qTemp.right);

            // 左树不断入栈
            while (pStack.peek().left != null || qStack.peek().left != null) {
                if (pStack.peek().left == null || qStack.peek().left == null) {
                    return false;
                }

                pStack.push(pStack.peek().left);
                qStack.push(qStack.peek().left);
            }
        }
    }
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58

0ms | 100.00% Run time
36.3MB | 65.23% Memory

public boolean isSameTree2(TreeNode p, TreeNode q) {
    if (p == null || q == null) {
        if (p != null || q != null) {
            return false;
        } else {
            return true;
        }
    }

    // 思路：广度遍历
    Queue<TreeNode> pQueue = new LinkedList<>();
    Queue<TreeNode> qQueue = new LinkedList<>();

    pQueue.add(p);
    qQueue.add(q);

    while (true) {
        if (pQueue.isEmpty() || qQueue.isEmpty()) {
            if (!pQueue.isEmpty() || !qQueue.isEmpty()) {
                return false;
            } else {
                return true;
            }
        }

        TreeNode pTemp = pQueue.poll();
        TreeNode qTemp = qQueue.poll();

        if (pTemp.val != qTemp.val) {
            return false;
        }

        if (pTemp.left != null || qTemp.left != null) {
            if (pTemp.left == null || qTemp.left == null) {
                return false;
            } else {
                pQueue.add(pTemp.left);
                qQueue.add(qTemp.left);
            }
        }

        if (pTemp.right != null || qTemp.right != null) {
            if (pTemp.right == null || qTemp.right == null) {
                return false;
            } else {
                pQueue.add(pTemp.right);
                qQueue.add(qTemp.right);
            }
        }
    }
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51

# Review

6 Design Patterns Every Android Developer Must Know (opens new window)

# Tip

RecycleView可使用overScrollMode属性来去掉自带的过度滑动阴影
ProgressBar可自定义样式可使用scale来让进度条的左右都是圆角
可以使用<Space>代替margin，因为前者不会执行任何绘制操作，而后者会重新绘制
设置TextView#setFilters可以控制输入内容的长度或者监听输入内容做一些操作
runCatching非常适合用来处理一些可能会报错的表达式

暂无内容

← 第七十五周ARTS总结第七十七周ARTS总结 →

# 第七十六周ARTS总结

# Algorithm

# Review

# Tip

# Share