Leetcode之Maximum Average Subarray I

問題描述: Given an array consisting of n integers, find the contiguous subarray of given lengthk that has the maximum average value. And you need to output the maximum average value. 示例: Input: [1,12,-5,-
相關文章
相關標籤/搜索