485. 最大连续 1 的个数

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int ans = 0, cnt = 0;
        for (auto num : nums) {
            if (num == 1) {
                cnt += 1;
                ans = std::max(ans, cnt);
            } else {
                cnt = 0;
            }
        }
        return ans;
    }
}; 

impl Solution {
    pub fn find_max_consecutive_ones(nums: Vec<i32>) -> i32 {
        let (mut maximum, mut cnt) = (0, 0);
        for num in nums {
            if num == 1 {
                cnt += 1;
                maximum = maximum.max(cnt);
            } else {
                cnt = 0;
            }
        }
        maximum
    }
}