Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
31 lines (29 loc) · 762 Bytes

File metadata and controls

31 lines (29 loc) · 762 Bytes
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
package leetcode.sildeWindow;
public class leetcode643 {
public double findMaxAverage(int[] nums, int k) {
int left=0;
int right=k-1;
int sum=0;
int cursum=0;
for(int i=0;i<k;i++){
cursum+=nums[i];
}
sum=cursum;
while(right<nums.length){
if(right+1<nums.length){
cursum=cursum-nums[left]+nums[right+1];
sum=Math.max(sum,cursum);
}
left++;
right++; //窗口平移
}
return (sum*1.0)/k;
}
public static void main(String[] args) {
new leetcode643().findMaxAverage(
new int[]{
1,12,-5,-6,50,3
},1
);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.