leetcode485

水题，只需要注意末尾是1的情况，最后再比较一下，

直接上代码

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