refactor 643

fishercoder1534 · fishercoder1534 · commit b5edf8c7fcbc · 2020-07-17T20:07:25.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_643.java b/src/main/java/com/fishercoder/solutions/_643.java
@@ -1,17 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 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 = 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 _643 {
 
     public static class Solution1 {
