【LeetCode】485. Max Consecutive Ones

题目：

时间复杂度O（n）

代码：

#include <iostream>  
#include <vector>
using namespace std;

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int res = 0;
		int count = 0;
		for(int i : nums){
			if(i){
				count++;
				res = count > res ? count : res;
			}
			else count = 0;
		}
		return res;
    }
};
int main(){
        Solution so; 
		int a[6] = {1,1,0,1,1,1};
		vector<int> nums(a,a+6);
		cout << so.findMaxConsecutiveOnes(nums) << endl;
        system("pause");  
        return 0;  
}