2. 程式人生 > >643. Maximum Average Subarray I 最大子陣列平均數

643. Maximum Average Subarray I 最大子陣列平均數

阿新 • • 發佈：2017-07-16
bject ble height r12 for over xpl example padding

Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need to output the maximum average value.

Example 1:

Input: [1,12,-5,-6,50,3], k = 4Output: 12.75Explanation: Maximum average is (12-5-6+50)/4 = 51/4 = 12.75


Note:

  1. 1 <= k <= n

    <= 30,000.

  2. Elements of the given array will be in the range [-10,000, 10,000].

題意：求一個數組的最大子陣列平均數

思路：運用動態規劃，找出和最大，長度為k的子陣列

12345678910111213141516171819class Solution(object): def findMaxAverage(self, nums, k): """ :type nums: List[int] :type k: int :rtype: float """
sum = 0 curSum = 0 addNum = 0 for i in range(0, len(nums)): if addNum < k: curSum += nums[i] sum = curSum addNum += 1 else: curSum = curSum - nums[i - k] + nums[i] sum = max(sum, curSum)
return sum * 1.0 / k


null

643. Maximum Average Subarray I 最大子陣列平均數

相關推薦

643. Maximum Average Subarray I 最大子陣列平均數

bject ble height r12 for over xpl example padding Given an array consisting of n integers, find the contiguous subarray of given length k

643. Maximum Average Subarray I 最大子數組的平均值

異常 圖片 value 題目 color 一句話 exp output close ［抄題］： Given an array consisting of n integers, find the contiguous subarray of given length k t

643. Maximum Average Subarray I（python+cpp）

題目： Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you ne

[LeetCode] 628. Maximum Product of Three Numbers 三個數字的最大乘積 [LeetCode] 152. Maximum Product Subarray 求最大子陣列乘積 All LeetCode Questions List 題目彙總

Given an integer array, find three numbers whose product is maximum and output the maximum product. Example 1: Input: [1,2,3] Output: 6  Example 2

643. Maximum Average Subarray I

spa lan index subarray ems sub ret bsp pre 1. Question: 643. Maximum Average Subarray I url https://leetcode.com/problems/maximum-average

LeetCode-643. Maximum Average Subarray I

Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need t

[LeetCode] Maximum Product Subarray 求最大子陣列乘積

Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4],the

[LeetCode] Maximum Average Subarray I 子陣列的最大平均值

Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need to output the ma

leetCode-Maximum Average Subarray I

2.7 temp dma out integer 表示 script length turn Description: Given an array consisting of n integers, find the contiguous subarray of gi

152 Maximum Product Subarray 乘積最大子序列

-s true www. com for pre pro return ems 找出一個序列中乘積最大的連續子序列（該序列至少包含一個數）。例如， 給定序列 [2,3,-2,4]，其中乘積最大的子序列為 [2,3] 其乘積為 6。詳見：https://leetcode.co

(Java) LeetCode 152. Maximum Product Subarray —— 乘積最大子序列

ann solution least posit 當前 res 暴力 根據 with Given an integer array nums, find the contiguous subarray within an array (containing at least

[LeetCode] 152. Maximum Product Subarray 求最大子數組乘積

lan range ++i logs local i++ www. spl 題目 Given an integer array nums, find the contiguous subarray within an array (containing at least o

leetcode （Maximum Average Subarray I）

Title：Maximum Average Subarray I    643 Difficulty：Easy 原題leetcode地址：https://leetcode.com/problems/maximum-average-subarray-i/  

leetcode 53. Maximum Subarray 最大子陣列 分治演算法

題目 給定一個整數陣列，找出和最大的連續子陣列（至少包含一個元素）並返回最大和。 嘗試使用分治演算法實現 思路 參考了《演算法導論》裡關於分治的講解，正好就是這個題目，不過它的方法比較細緻，把最大子陣列的位置也求出來了。這道題只要求最大和，我簡化了一下。思路是

[LeetCode] Maximum Average Subarray II 子陣列的最大平均值之二

Given an array consisting of n integers, find the contiguous subarray whose length is greater than or equal to k that has the maximum average value. And

[LeetCode] Maximum Size Subarray Sum Equals k 最大子陣列之和為k

Given an array nums and a target value k, find the maximum length of a subarray that sums to k. If there isn't one, return 0 instead. Example 1: G

[LeetCode] Maximum Subarray 最大子陣列

Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,

leetcode 53 Maximum Subarray （求最大子陣列的和）

題目要求 （高頻題） 給定一個整數陣列nums，找到具有最大和的連續子陣列（包含至少一個數字）並返回其和。 示例 Input: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 Explanation: [4,-1,2,1] has the large

LeetCode | Maximum Subarray（連續最大子陣列）

Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array 

動態規劃法（八）最大子陣列問題（maximum subarray problem）

問題簡介   本文將介紹計算機演算法中的經典問題——最大子陣列問題（maximum subarray problem）。所謂的最大子陣列問題，指的是：給定一個數組A，尋找A的和最大的非空連續子陣列。比如，陣列 A = [-2, -3, 4, -1, -2, 1