摘要:
将时间点排序就行 class Solution: def minMeetingRooms(self, intervals: List[List[int]]) -> int: points = [] for interval in intervals: points.append([interval[ 阅读全文
摘要:
两个栈,永远记录当前解出来的码 class Solution: def decodeString(self, s: str) -> str: strStack = [] numStack = [] current = '' num = 0 for char in s: if char >= '0' 阅读全文