CT371

Notary's Ledger of ribbons

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

It is audit day at the forest village of Briarthorn. Notary spreads the ribbons records across the table and picks up a sharp pencil. Task: Print the length of the longest run of the same character. Input format: One line with a single lowercase string s. Output format: Print the maximum run length. Constraints: 1 <= |s| <= 162; s contains lowercase English letters.

Example 1:

Input: cccccccccccabbbbbbbbbaaaaabbbaaaaaaaaabbbbcccccaaaa
Output: 11

Example 2:

Input: ccccccccbacccccbbbbbbaaaaabbbbcccccabbbbbccbbcccabbb
Output: 8

Example 3:

Input: aaaaaaaaccaaabbbaaaaaaccccccccccccccbbbbbbbbbbbbbccccbbbbbbbbccccccccbbbbccccca
Output: 14

Constraints:

1 <= |s| <= 162; s contains lowercase English letters.

Loading...
Test Cases:No test cases
No test cases available.