225-用佇列實現棧
阿新 • • 發佈:2021-02-09
技術標籤:s
class Solution { public: double findMaxAverage(vector<int>& nums, int k) { int sum = 0; int n = nums.size(); for (int i = 0; i < k; i++) { sum += nums[i]; } int maxSum = sum; for (int i = k; i < n; i++) { sum = sum - nums[i - k] + nums[i]; maxSum = max(maxSum, sum); } return double(maxSum) / k; } };