Max Consecutive Ones[LeetCode 485]

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/cyrususie/article/details/78706745

Ans

---

#include <iostream>
#include <vector>

using namespace std;

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