摘要: 方法一:暴力 时间O(nk) 1 class Solution: 2 def maxInWindows(self, num, size): 3 # write code here 4 if len(num)*size == 0: 5 return [] 6 res=[] 7 for i in ran 阅读全文
posted @ 2020-01-08 21:03 Assange 阅读(227) 评论(0) 推荐(0) 编辑