Max Consecutive Ones[LeetCode 485]

来源:互联网 发布:winzip mac 6 注册码 编辑:程序博客网 时间:2024/05/22 12:55

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;    }};
原创粉丝点击