MaxConsecutiveOnes485

Author: fluency03

README.md

@@ -44,11 +44,11 @@
 | [Graph](https://github.com/fluency03/leetcode-java/blob/master/src/graph) |
 
 
-# Total: 295
+# Total: 296
 
 | Easy |  Medium | Hard | - |
 |:----:|:-------:|:----:|:-:|
-|  78  |   162   |  52  | 3 |
+|  79  |   162   |  52  | 3 |
 
 
 | Question | Solution | Difficulty |
@@ -296,6 +296,7 @@
 | [477. Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/TotalHammingDistance477.java) | Medium |
 | [480. Sliding Window Median](https://leetcode.com/problems/sliding-window-median/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/SlidingWindowMedian480.java) | Hard |
 | [482. License Key Formatting](https://leetcode.com/problems/license-key-formatting/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/LicenseKeyFormatting482.java) | Easy |
+| [485. Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/MaxConsecutiveOnes485.java) | Easy |
 | [490. The Maze](https://leetcode.com/problems/the-maze/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/TheMaze490.java) | Medium |
 | [503. Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/NextGreaterElementII503.java) | Medium |
 | [508. Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/MostFrequentSubtreeSum508.java) | Medium |

src/MaxConsecutiveOnes485.java

@@ -0,0 +1,47 @@
+/**
+ * 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 MaxConsecutiveOnes485 {
+    public int findMaxConsecutiveOnes(int[] nums) {
+        if (nums == null || nums.length == 0) return 0;
+        int left = 0;
+        int right = 0;
+        int max = 0;
+        while (right < nums.length) {
+            if (nums[right] == 1) {
+                right++;
+                continue;
+            }
+            max = Math.max(max, right-left);
+            left = right;
+            while (left < nums.length && nums[left] == 0) left++;
+            right = left;
+        }
+        max = Math.max(max, right-left);
+        return max;
+    }
+
+
+    /**
+     * https://leetcode.com/problems/max-consecutive-ones/discuss/96693/Java-4-lines-concise-solution-with-explanation
+     */
+    public int findMaxConsecutiveOnes2(int[] nums) {
+        int maxHere = 0, max = 0;
+        for (int n : nums)
+            max = Math.max(max, maxHere = n == 0 ? 0 : maxHere + 1);
+        return max; 
+    }
+
+}