1
Input: nums = [1,1,0,1,1,1]
2
Output: 3
3
Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.

1
Input: nums = [1,0,1,1,0,1]
2
Output: 2

1
class Solution:
2
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
3
        mx = 0
4
        cnt = 0
5
        for x in nums:
6
            if x == 1:
7
                cnt += 1
8
            else:
9
                mx = max(mx, cnt)
10
                cnt = 0
11
            mx = max(mx, cnt)
12
        return mx

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

1
Input: s = "leetcode"
2
Output: 2
3
Explanation: The substring "ee" is of length 2 with the character 'e' only.

1
Input: s = "abbcccddddeeeeedcba"
2
Output: 5
3
Explanation: The substring "eeeee" is of length 5 with the character 'e' only.

1
class Solution:
2
    def maxPower(self, s: str) -> int:
3
        ans = 1
4
        cnt = 1
5
        for i in range(len(s)):
6
            if s[i] == s[i - 1]:
7
                cnt += 1
8
            else:
9
                cnt = 1
10
            ans = max(ans, cnt)
11
        return ans

1
class Solution {
2
public:
3
    int maxPower(string s) {
4
        int ans = 0;
5
        int l = 0;
6
        int n = s.size();
7
        map<char, int> cnt;
8
        for (int r = 0; r < n; r++) {
9
            cnt[s[r]]++;
10
            while (cnt.size() > 1) {
11
                cnt[s[l]]--;
12
                if (cnt[s[l]] == 0) {
13
                    cnt.erase(s[l]);
14
                }
15
                l++;
16
            }
17
            ans = max(ans, r - l + 1);
18
        }
19
        return ans;
20
    }
21
};