【Leetcode】239. Sliding Window Maximum
摘要:
问题描述: For example, Given nums = [1,3,-1,-3,5,3,6,7], and k = 3. Therefore, return the max sliding window as [3,3,5,5,6,7].、 问题分析: 又是一道区间最值的题,又要求近线性时间的 阅读全文
posted @ 2016-04-18 16:01 暴力的轮胎 阅读(310) 评论(0) 推荐(0) 编辑