LeetCode --- 1446. Consecutive Characters 解题报告

Posted 杨鑫newlfe

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了LeetCode --- 1446. Consecutive Characters 解题报告相关的知识，希望对你有一定的参考价值。

The power of the string is the maximum length of a non-empty substring that contains only one unique character.

Given a string s, return the power of s.

Example 1:

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

Example 2:

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

Constraints:

  • 1 <= s.length <= 500
  • s consists of only lowercase English letters.

所有代码均可在Github中找到：

以上是关于LeetCode --- 1446. Consecutive Characters 解题报告的主要内容，如果未能解决你的问题，请参考以下文章