solves max consecutive ones

Author: anishLearnsToCode

README.md

@@ -126,7 +126,7 @@
 | 475 | [Heaters](https://leetcode.com/problems/heaters) | Medium | |
 | 476 | [Number Complement](https://leetcode.com/problems/number-complement) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/NumberComplement.java) |
 | 482 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/LicenseKeyFormatting.java) |
-| 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | Easy | |
+| 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MaxConsecutiveOnes.java) |
 | 492 | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | Easy | |
 | 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | Easy | |
 | 500 | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | Easy | |

src/MaxConsecutiveOnes.java

@@ -0,0 +1,19 @@
+public class MaxConsecutiveOnes {
+    public int findMaxConsecutiveOnes(int[] array) {
+        int maxOnes = 0, current = 0;
+        for (int number : array) {
+            if (number == 1) {
+                current++;
+                maxOnes = Math.max(maxOnes, current);
+            } else {
+                current = 0;
+            }
+        }
+
+        return maxOnes;
+    }
+
+    public static void main(String[] args) {
+
+    }
+}