秋榆梧桐

分类

题解(14)

/ 注册

全部文章（共13篇）

Python3

没用递归分析左子树与右子树居然也能通过，只作为参考，下面考虑不够完全，没有递归左子树与右子树。测试用例不够全面。 def VerifySquenceOfBST(self, sequence): # write code here if sequence == N...

python

2020-03-23

0 540

# -*- coding:utf-8 -*- # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def Fin...

2020-03-18

0 404

# -*- coding:utf-8 -*- # class RandomListNode: # def __init__(self, x): # self.label = x # self.next = None # self.random ...

2020-03-18

0 383

# -*- coding:utf-8 -*- # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: # 返回合并后列表 ...

2020-03-18

0 544

# -*- coding:utf-8 -*- # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: # 返回从尾部到头...

2020-03-17

0 479

python3----so easy # -*- coding:utf-8 -*- class Solution: def __init__(self): self.stack = [] self.minValue = [] def push(sel...

2020-03-16

0 442

# -*- coding:utf-8 -*- class Solution: def cutRope(self, number): # write code here if number < 2: return 0 ...

2020-03-16

0 457

python3代码 class Solution: def movingCount(self, threshold, rows, cols): # write code here if not threshold or not rows or not col...

2020-03-16

0 473

while True: try: high = int(input()) sm = high for i in range(4): high /= 2 sm += 2 * high ...

2020-03-03

12 1117

while True: try: a = int(input()) temp = 1 b = [] for j in range(0, a): temp = temp + j m ...

2020-03-03

5 769