摘要：
1 class Solution: 2 def getKth(self, lo: int, hi: int, k: int) -> int: 3 memo = dict() 4 memo[1] = 0 5 for i in range(1,hi+1): 6 cur = i 7 count = 0 8 阅读全文
posted @ 2020-03-26 10:54
Sempron2800+
阅读(193)
评论(0)
推荐(0)
摘要：
1 class Solution: 2 def __init__(self): 3 self.l = [] 4 5 def inOrder(self,node): 6 if node != None: 7 self.inOrder(node.left) 8 self.l.append(node.va 阅读全文
posted @ 2020-03-26 10:30
Sempron2800+
阅读(153)
评论(0)
推荐(0)
浙公网安备 33010602011771号