Add solution #485

Author: JoshCrozier

0485-max-consecutive-ones.js

@@ -0,0 +1,20 @@
+/**
+ * 485. Max Consecutive Ones
+ * https://leetcode.com/problems/max-consecutive-ones/
+ * Difficulty: Easy
+ *
+ * Given a binary array nums, return the maximum number of consecutive 1's in the array.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findMaxConsecutiveOnes = function(nums) {
+  let max = 0;
+  for (let i = 0, count = 0; i < nums.length; i++) {
+    count = nums[i] ? count + 1 : 0;
+    max = Math.max(max, count);
+  }
+  return max;
+};

README.md

@@ -195,6 +195,7 @@
 461|[Hamming Distance](./0461-hamming-distance.js)|Easy|
 463|[Island Perimeter](./0463-island-perimeter.js)|Medium|
 476|[Number Complement](./0476-number-complement.js)|Easy|
+485|[Max Consecutive Ones](./0485-max-consecutive-ones.js)|Easy|
 491|[Non-decreasing Subsequences](./0491-non-decreasing-subsequences.js)|Medium|
 492|[Construct the Rectangle](./0492-construct-the-rectangle.js)|Easy|
 500|[Keyboard Row](./0500-keyboard-row.js)|Easy|