网址:https://leetcode.com/problems/max-consecutive-ones/
很简单的一题
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int ans = ;
int res = ;
for(auto i : nums)
{
res = i?res+:;
ans = max(ans,res);
} return ans; }
};
网址:https://leetcode.com/problems/max-consecutive-ones/
很简单的一题
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int ans = ;
int res = ;
for(auto i : nums)
{
res = i?res+:;
ans = max(ans,res);
} return ans; }
};