add 485

fishercoder1534 · fishercoder1534 · commit 31b7ecfa0fe8 · 2019-03-22T17:44:49.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_485.java b/src/main/java/com/fishercoder/solutions/_485.java
@@ -0,0 +1,33 @@
+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) {
+            int maxLen = 0;
+            for (int i = 0; i < nums.length; i++) {
+                int currentLen = 0;
+                while (i < nums.length && nums[i] == 1) {
+                    i++;
+                    currentLen++;
+                }
+                maxLen = Math.max(maxLen, currentLen);
+            }
+            return maxLen;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_485Test.java b/src/test/java/com/fishercoder/_485Test.java
@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._485;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _485Test {
+    private static _485.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _485.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(3, solution1.findMaxConsecutiveOnes(new int[]{1, 1, 0, 1, 1, 1}));
+    }
+
+}
