摘要：
from queue import Queue class Solution: def deckRevealedIncreasing(self, deck): n = len(deck) que = Queue(maxsize=n) deck.sort() res = [0]*n for i in rang... 阅读全文
摘要：
class Solution: def __init__(self): self.li = [] def midSearch(self,node): if(node != None): self.midSearch(node.left) self.li.append(node.val) ... 阅读全文