[update] 643

Author: Dream

README.md

@@ -79,7 +79,7 @@
 |655|[Print Binary Tree](https://leetcode.com/problems/print-binary-tree/) | |Medium|
 |652|[Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/) | |Medium|
 |647|[Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | |Medium|
-|643|[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/description/) | |Easy|
+|643|[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/description/) | [Java_dream](./algorithms/maximumAverageSubarrayI/MaximumAverageSubarrayI.java) |Easy|
 |628|[Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/) | |Easy|
 |627|[Swap Salary](https://leetcode.com/problems/swap-salary/) | [Mysql](./algorithm/swapSalary/Solution.java) | |Medium|
 |626|[Exchange Seats](https://leetcode.com/problems/exchange-seats/) | [Mysql](./algorithm/swapSalary/Solution.java) | |Easy|

algorithms/maximumAverageSubarrayI/MaximumAverageSubarrayI.java

@@ -0,0 +1,17 @@
+/**
+ * @author Dream
+ */
+public class MaximumAverageSubarrayI {
+    public double findMaxAverage(int[] nums, int k) {
+        int sum = 0, max;
+        for (int i = 0; i < k; i++) {
+            sum += nums[i];
+        }
+        max = sum;
+        for (int i = k; i < nums.length; i++) {
+            sum = sum - nums[i - k] + nums[i];
+            max = Math.max(max, sum);
+        }
+        return (double)max/k;
+    }
+}