leetcode485

#include<cmath>
class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        vector<int>::iterator it;
        int ans=0,tmp=0;
        for(it=nums.begin();it!=nums.end();it++)
        {
            if( (*it)==1){
                tmp++;
            }
            if((*it)==0)
            {
                
                tmp=0;
                
            }
            ans=max(tmp,ans);
        }
        return ans;
    }
};