leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0485.cpp (283B)

0 class Solution { 1 public: 2 int findMaxConsecutiveOnes(vector<int> &nums) { 3 int maxi = 0; 4 int cnt = 0; 5 6 for (int i : nums) 7 if (i) 8 maxi = max(maxi, ++cnt); 9 else 10 cnt = 0; 11 12 return maxi; 13 } 14 };