leetcode 485 Max Consecutive Ones

python:

class Solution:
    def findMaxConsecutiveOnes(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        res = 0
        l = 0
        for i in nums:
            if i == 1:
                l += 1
            else:
                res = max(res, l)
                l = 0
        res = max(res, l)
        return res

c++:

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int res = 0;
        int l = 0;
        for (int i=0; i<=nums.size(); i++){
            if(nums[i] == 1 && i != nums.size())
                l++;
            else{
                res = max(res, l);
                l = 0;
            }               
        }
        return res;
    }
};