• [LeetCode]题解(python):100-Same Tree


    题目来源:

      https://leetcode.com/problems/same-tree/


    题意分析:

      判断两棵树是否相等。


    题目思路:

      用递归的思想,先判断根节点,再判断左右子树。


    代码(python):

      

    # Definition for a binary tree node.
    # class TreeNode(object):
    #     def __init__(self, x):
    #         self.val = x
    #         self.left = None
    #         self.right = None
    
    class Solution(object):
        def isSameTree(self, p, q):
            """
            :type p: TreeNode
            :type q: TreeNode
            :rtype: bool
            """
            if p == None:
                return q == None
            if q == None:
                return p == None
            if p.val != q.val:
                return False
            else:
                return self.isSameTree(p.left,q.left) and self.isSameTree(p.right,q.right)
    View Code
  • 相关阅读:
    9.对话框
    8.布局管理器
    7.对象模型
    6.添加动作
    5.Qt模块简介
    4.自定义信号槽
    3.信号槽
    2.Helloworld
    1.Qt简介
    Problem E: 成绩排序
  • 原文地址:https://www.cnblogs.com/chruny/p/5251338.html
Copyright © 2020-2023  润新知