[LeetCode]最大连续1的个数

题目

代码

class Solution {

public:

    int findMaxConsecutiveOnes(vector<int>& nums) {

        int length=0;

        int maxLength=0;

        for(int i=0;i<nums.size();i++)

        {

            if(nums[i]==0)

                length=0;

            else

                length++;

            if(length>maxLength)

                maxLength=length;

        }

        return maxLength;

    }

};

[LeetCode]最大连续1的个数的相关教程结束。

《[LeetCode]最大连续1的个数.doc》

下载本文的Word格式文档，以方便收藏与打印。

相关推荐

【LeetCode OJ】Recover Binary Search Tree

Problem Link: https://oj.leetcode.com/problems/recover-binary-search-tree/ We know that the inorder traversal of a binary search tree should be a sorted array. Therefore, we can compare each node w...
2023-08-01编程代码leetcode,oj,recover
【LeetCode OJ】Validate Binary Search Tree

Problem Link: https://oj.leetcode.com/problems/validate-binary-search-tree/ We inorder-traverse the tree, and for each node we check if current_node.val > prev_node.val. The code is as follows. ...
2023-08-01编程代码leetcode,oj,validate
【LeetCode OJ】Binary Tree Level Order Traversal

Problem Link: https://oj.leetcode.com/problems/binary-tree-level-order-traversal/ Traverse the tree level by level using BFS method. # Definition for a binary tree node # class TreeNode: # def...
2023-08-01编程代码Binary,leetcode,oj
【LeetCode OJ】Symmetric Tree

Problem Link: https://oj.leetcode.com/problems/symmetric-tree/ To solve the problem, we can traverse the tree level by level. For each level, we construct an array of values of the length 2^depth, ...
2023-08-01编程代码leetcode,oj,tree
【LeetCode OJ】Same Tree

Problem Link: https://oj.leetcode.com/problems/same-tree/ The following recursive version is accepted but the iterative one is not accepted... # Definition for a binary tree node # class TreeNode:...
2023-08-01编程代码leetcode,oj,tree
C#，判断数字集合是否是连续的

/// <summary> /// 判断数字集合是否是连续的 /// </summary> /// <returns></returns> public bool IsContinuous(List<int> numList) { numList.Sort((x, y) => -x.Compar...
2023-08-01编程代码判断,连续,集合
Leetcode 242.有效的字母异位词(Python3)

题目：给定两个字符串 s 和 t ，编写一个函数来判断 t 是否是 s 的一个字母异位词。示例 1: 输入: s = "anagram", t = "nagaram" 输出: true 示例 2: 输入: s =...
2023-08-01编程代码leetcode,字母,异位
Leetcode 242.有效的字母异位词 By Python

给定两个字符串 s 和 t ，编写一个函数来判断 t 是否是 s 的一个字母异位词。示例 1: 输入: s = "anagram", t = "nagaram" 输出: true 示例 2: 输入: s = "rat", t = "car&...
2023-08-01编程代码leetcode,字母,异位