leetcode--485. Max Consecutive Ones

地址：https://leetcode.com/problems/max-consecutive-ones/#/description

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