FilesExpand file tree

 master

/

MaximumAverageSubarrayI643.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

35 lines (31 loc) · 939 Bytes

 master

/

MaximumAverageSubarrayI643.java

Copy path

Top

File metadata and controls

• Code
• Blame

35 lines (31 loc) · 939 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

/**

* 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 = 4

* Output: 12.75

* Explanation: Maximum average is (12-5-6+50)/4 = 51/4 = 12.75

*

* Note:

* 1 <= k <= n <= 30,000.

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

*/

public class MaximumAverageSubarrayI643 {

public double findMaxAverage(int[] nums, int k) {

if (nums.length < k) return 0.0;

int len = nums.length;

long res = 0;

for (int i=0; i<k; i++) {

res += (long) nums[i];

}

long tmp = res;

for (int i=0; i<len-k; i++) {

tmp -= nums[i];

tmp += nums[i+k];

if (tmp > res) res = tmp;

}

return res / (k * 1.0);

}

}