程式語言 - LeetCode - C++ - 485. Max Consecutive Ones



題目:


解答:

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int cnt = 0;
        int ans = 0;

        for (int n : nums) {
            if (n == 1) {
                cnt += 1;
            }
            else {
                cnt = 0;
            }

            ans = max(ans, cnt);
        }

        return ans;
    }
};