class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int maxCount = 0, count = 0;
int n = nums.size();
for (int i = 0; i < n; i++) {
if (nums[i] == 1) {
count++;
maxCount = max(maxCount, count);
} else {
maxCount = max(maxCount, count);
count = 0;
}
}
return maxCount;
}
};
[leetcode]max-consecutive-ones 最大连续1的个数
最新推荐文章于 2024-07-21 08:37:44 发布