Update leetcode485最大连续1的个数.md

azl397985856 · web-flow · commit c6060983ec80 · 2021-04-26T14:52:03.000+08:00
diff --git a/animation-simulation/数组篇/leetcode485最大连续1的个数.md b/animation-simulation/数组篇/leetcode485最大连续1的个数.md
@@ -66,6 +66,8 @@ class Solution {
 
 好啦，下面我们直接看代码吧。
 
+Java Code:
+
 ```java
 class Solution {
     public int findMaxConsecutiveOnes(int[] nums) {
@@ -88,3 +90,20 @@ class Solution {
 }
 ```
 
+Python3 Code:
+
+
+```py
+class Solution:
+    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
+        ans = i = t = 0
+        for j in range(len(nums)):
+            if nums[j] == 1:
+                t += 1
+                ans = max(ans, t)
+            else:
+                i = j + 1
+                t = 0
+        return ans
+```
+
