leetcode 643 Maximum Average Subarray I
来源：互联网 发布：医疗软件上市公司 编辑：程序博客网 时间：2024/06/05 08:55
class Solution { public double findMaxAverage(int[] nums, int k) { int sum=0; for(int i=0;i<k;i++) sum+=nums[i]; int max=sum; for(int i=k;i<nums.length;i++){ sum+=nums[i]-nums[i-k]; max=Math.max(max,sum); } return (max+0.0)/k ; }}阅读全文
0 0
- Leetcode 643 Maximum Average Subarray I
- LeetCode 643 Maximum Average Subarray I
- Leetcode 643 Maximum Average Subarray I
- leetcode 643 Maximum Average Subarray I
- LeetCode.643 Maximum Average Subarray I
- leetcode 643[easy]--Maximum Average Subarray I
- leetcode[Maximum Average Subarray I]
- leetCode-Maximum Average Subarray I
- 643 Maximum Average Subarray I
- LeetCode 643. Maximum Average Subarray I
- [LeetCode]643. Maximum Average Subarray I
- [LeetCode] 643. Maximum Average Subarray I
- LeetCode刷题【Array】 Maximum Average Subarray I
- LeetCode 643. Maximum Average Subarray I
- leetcode 643. Maximum Average Subarray I
- [LeetCode]643. Maximum Average Subarray I
- leetcode 643. Maximum Average Subarray I
- LeetCode 643. Maximum Average Subarray I
- XML的四种解析器(dom,sax,jdom,dom4j)原理及性能比较
- Xv6安装踩坑记
- string类型转换int类型
- 人工智能-超越经典搜索
- PCB电路板生产完成分析
- leetcode 643 Maximum Average Subarray I
- python引入导入自定义模块和外部文件
- canvas实现刮刮乐的效果
- 【期望DP】LOJ#6178. 「美团 CodeM 初赛 Round B」景区路线规划
- Scala学习(一):Scala中的函数式对象
- 【笔记】USB概述及协议基础
- Linux-vsftp-userlist
- rip简单了解
- java常用第三方类库
