[Leetcode]643. Maximum Average Subarray I
📄 Description
You are given an integer array nums
consisting of n
elements, and an integer k
.
Find a contiguous subarray whose length is equal to k
that has the maximum average value and return this value. Any answer with a calculation error less than will be accepted.
Example 1:
Input: nums = [1,12,-5,-6,50,3], k = 4
Output: 12.75000
Explanation: Maximum average is (12 - 5 - 6 + 50) / 4 = 51 / 4 = 12.75
Example 2:
Input: nums = [5], k = 1
Output: 5.00000
Constraints:
n == nums.length
1 <= k <= n <= 105
-104 <= nums[i] <= 104
💻 My Submission
class Solution:
def findMaxAverage(self, nums: List[int], k: int) -> float:
_sum=sum(nums[:k])
max_avg=_sum/k
for i in range(len(nums)-k):
_sum=_sum-nums[i]+nums[i+k]
window_avg=_sum/k
max_avg=max(max_avg,window_avg)
return max_avg
❓ How to solve the problem
- find the maximum K-length sum
- After, we can divide by K to get the average.
Clean version of my submission
class Solution:
def findMaxAverage(self, nums: List[int], k: int) -> float:
_sum=max_sum=sum(nums[:k])
for i in range(len(nums)-k):
_sum=_sum-nums[i]+nums[i+k]
max_sum=max(max_sum,_sum)
return max_sum/k
References
Author And Source
이 문제에 관하여([Leetcode]643. Maximum Average Subarray I), 우리는 이곳에서 더 많은 자료를 발견하고 링크를 클릭하여 보았다 https://velog.io/@limelimejiwon/Leetcode643.-Maximum-Average-Subarray-I저자 귀속: 원작자 정보가 원작자 URL에 포함되어 있으며 저작권은 원작자 소유입니다.
우수한 개발자 콘텐츠 발견에 전념 (Collection and Share based on the CC Protocol.)