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 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.75Note:1 <= k <= n <= 30,000.Elements of the given array will be in the range [-10,000, 10,000].

class Solution {public:    double findMaxAverage(vector<int>& nums, int k) {        double sum=0;        double value;        int flag=0;        int count=0;        int i=0;       while(count<nums.size()-k+1)       {             for(i=count;i<count+k;i++)               sum+=nums[i];            count++;            sum=sum/k;           if(sum>value||i==k)  value=sum;           sum=0;     }        return value;    }};