feat: add solutions to leetcode problem: No.0485

Author: yanglbme

solution/0400-0499/0485.Max Consecutive Ones/README.md

@@ -33,15 +33,59 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
+        res = t = 0
+        for num in nums:
+            if num == 1:
+                t += 1
+            else:
+                res = max(res, t)
+                t = 0
+        return max(res, t)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int findMaxConsecutiveOnes(int[] nums) {
+        int res = 0, t = 0;
+        for (int num : nums) {
+            if (num == 1) {
+                ++t;
+            } else {
+                res = Math.max(res, t);
+                t = 0;
+            }
+        }
+        return Math.max(res, t);
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findMaxConsecutiveOnes = function (nums) {
+  let res = 0,
+    t = 0;
+  for (let num of nums) {
+    if (num == 1) {
+      ++t;
+    } else {
+      res = Math.max(res, t);
+      t = 0;
+    }
+  }
+  return Math.max(res, t);
+};
 ```
 
 ### **...**

solution/0400-0499/0485.Max Consecutive Ones/README_EN.md

@@ -41,13 +41,57 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
+        res = t = 0
+        for num in nums:
+            if num == 1:
+                t += 1
+            else:
+                res = max(res, t)
+                t = 0
+        return max(res, t)
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int findMaxConsecutiveOnes(int[] nums) {
+        int res = 0, t = 0;
+        for (int num : nums) {
+            if (num == 1) {
+                ++t;
+            } else {
+                res = Math.max(res, t);
+                t = 0;
+            }
+        }
+        return Math.max(res, t);
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findMaxConsecutiveOnes = function (nums) {
+  let res = 0,
+    t = 0;
+  for (let num of nums) {
+    if (num == 1) {
+      ++t;
+    } else {
+      res = Math.max(res, t);
+      t = 0;
+    }
+  }
+  return Math.max(res, t);
+};
 ```
 
 ### **...**

solution/0400-0499/0485.Max Consecutive Ones/Solution.java

@@ -1,14 +1,14 @@
 class Solution {
     public int findMaxConsecutiveOnes(int[] nums) {
-        int res = 0;
-        int cnt = 0;
+        int res = 0, t = 0;
         for (int num : nums) {
             if (num == 1) {
-                res = Math.max(res, ++cnt);
+                ++t;
             } else {
-                cnt = 0;
+                res = Math.max(res, t);
+                t = 0;
             }
         }
-        return res;
+        return Math.max(res, t);
     }
-}
+}

solution/0400-0499/0485.Max Consecutive Ones/Solution.js

@@ -3,18 +3,15 @@
  * @return {number}
  */
 var findMaxConsecutiveOnes = function (nums) {
-  var max = 0;
-  var n = 0;
-  for (var i = 0; i < nums.length; i++) {
-    if (nums[i] == 0) {
-      n = 0;
+  let res = 0,
+    t = 0;
+  for (let num of nums) {
+    if (num == 1) {
+      ++t;
     } else {
-      n++;
-    }
-    max = n > max ? n : max;
-    if (n > max) {
-      max = n;
+      res = Math.max(res, t);
+      t = 0;
     }
   }
-  return max;
+  return Math.max(res, t);
 };

solution/0400-0499/0485.Max Consecutive Ones/Solution.py

@@ -0,0 +1,10 @@
+class Solution:
+    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
+        res = t = 0
+        for num in nums:
+            if num == 1:
+                t += 1
+            else:
+                res = max(res, t)
+                t = 0
+        return max(res, t)