本文整理汇总了Python中solution.Solution.maxDepth方法的典型用法代码示例。如果您正苦于以下问题：Python Solution.maxDepth方法的具体用法？Python Solution.maxDepth怎么用？Python Solution.maxDepth使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类solution.Solution的用法示例。
在下文中一共展示了Solution.maxDepth方法的6个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: test_1
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import maxDepth [as 别名]
def test_1():
sol = Solution()
a1 = TreeNode(1)
a0 = TreeNode(0)
a3 = TreeNode(3)
a1.left, a1.right = a0, a3
a2 = TreeNode(2)
a4 = TreeNode(4)
a3.left, a3.right = a2, a4
assert sol.maxDepth(a1) == 3
assert sol.maxDepth(a0) == 1
assert sol.maxDepth(a3) == 2示例2: test001
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import maxDepth [as 别名]
def test001(self):
s = Solution()
root = TreeNode('root')
n = s.maxDepth(root)
print "input:\t", root
print "expect:\t", 1
print "output:\t", n示例3: test002
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import maxDepth [as 别名]
def test002(self):
s = Solution()
root = TreeNode('root')
nodeR = TreeNode('nodeR')
root.right = nodeR
n = s.maxDepth(root)
print "input:\t", root
print "expect:\t", 2
print "output:\t", n示例4: test004
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import maxDepth [as 别名]
def test004(self):
s = Solution()
root = TreeNode('root')
nodeR = TreeNode('nodeR')
nodeRR = TreeNode('nodeRR')
nodeRL = TreeNode('nodeRL')
root.right = nodeR
nodeR.right = nodeRR
nodeR.left = nodeRL
n = s.maxDepth(root)
print "input:\t", root
print "expect:\t", 3
print "output:\t", n示例5: test_0
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import maxDepth [as 别名]
def test_0():
sol = Solution()
assert sol.maxDepth(None) == 0
assert sol.maxDepth(TreeNode(3)) == 1示例6: len
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import maxDepth [as 别名]
q.append(left)
idx += 1
if idx == len(tree):
break
right = constructOne(tree[idx])
idx += 1
tn.right = right
q.append(right)
return root
def printNode(tn, indent):
sb = ""
for i in range(indent):
sb += "\t"
sb += str(tn.val)
print(sb)
def printTree(root, indent):
if not root:
return
printTree(root.right, indent + 1)
printNode(root, indent)
printTree(root.left, indent + 1)
inpt = createTree("1, 2, #, 3, #, 4, #, 5")
# inpt = createTree("3, 9, 20, #, #, 15, 7")
sol = Solution()
res = sol.maxDepth(inpt)
print(res)
# printTree(inpt, 0)