refactor 485

fishercoder1534 · fishercoder1534 · commit dd20087ddca8 · 2020-06-28T19:27:42.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_485.java b/src/main/java/com/fishercoder/solutions/_485.java
@@ -1,20 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 485. Max Consecutive Ones
- *
- * Given a binary array, find the maximum number of consecutive 1s in this array.
- *
- * Example 1:
- *
- * Input: [1,1,0,1,1,1]
- * Output: 3
- * Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.
- *
- * Note:
- * The input array will only contain 0 and 1.
- * The length of input array is a positive integer and will not exceed 10,000
- * */
 public class _485 {
     public static class Solution1 {
         public int findMaxConsecutiveOnes(int[] nums) {
