网址:https://leetcode.com/problems/max-consecutive-ones/
很简单的一题
1 class Solution { 2 public: 3 int findMaxConsecutiveOnes(vector<int>& nums) { 4 int ans = 0; 5 int res = 0; 6 for(auto i : nums) 7 { 8 res = i?res+1:0; 9 ans = max(ans,res); 10 } 11 12 return ans; 13 14 } 15 };