Ringo201909111548427

题解

/ 注册

全部文章 / 题解（共6篇）

题解 | #平衡二叉树#

-- coding:utf-8 -- class Solution: def LeftRotateString(self, s, n): return s[n:]+s[0:n]

2021-08-07

0 175

题解 | #平衡二叉树#

-- coding:utf-8 -- class TreeNode: def init(self, x): self.val = x self.left = None self.right = None class Solution: def IsBalanced(self,pRoot): ...

2021-08-07

0 225

题解 | #顺时针打印矩阵#

-- coding:utf-8 -- class TreeNode: def init(self, x): self.val = x self.left = None self.right = None class Solution: # 返回从上到下每个节点值列表，例：[1,2,3] ...

2021-07-07

0 333

题解 | #顺时针打印矩阵#

-- coding:utf-8 -- class Solution: stack=[] def IsPopOrder(self, pushV, popV): # write code here i=0 j=0 while True:...

2021-07-07

0 290

题解 | #顺时针打印矩阵#

-- coding:utf-8 -- class Solution: # matrix类型为二维列表，需要返回列表 output=[] def printMatrix(self, matrix): # write code here return sel...

2021-07-06

0 316

题解 | #树的子结构#

using System;using System.Collections.Generic;class Solution{ public bool HasSubtree(TreeNode pRoot1, TreeNode pRoot2) { // write code he...

2021-07-05

0 260