EasyNo. 1446
Consecutive Characters — LeetCode 1446 Python Solution
- Pattern
- Hash Map
- Topics
- String
- Reading time
- 2 min
- Source
- leetcode.com
The problem
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
- Input
- s = "leetcode"
- Output
- 2
- Explanation
- The substring "ee" is of length 2 with the character 'e' only.
Python solution
class Solution:
def maxPower(self, s: str) -> int:
ans = t = 1
for a, b in pairwise(s):
if a == b:
t += 1
ans = max(ans, t)
else:
t = 1
return ansComplexity
- Time
- O(n)where n is the length of the string s
- Space · auxiliary
- O(1)
Pattern: Hash Map
Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 1446. Consecutive Characters is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.
The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 0006 | Zigzag Conversion | Medium |
| 0008 | String to Integer (atoi) | Medium |
| 0038 | Count and Say | Medium |
| 0058 | Length of Last Word | Easy |
| 0065 | Valid Number | Hard |
| 0068 | Text Justification | Hard |
Frequently asked questions
- How hard is LeetCode 1446. Consecutive Characters?
LeetCode 1446. Consecutive Characters is rated Easy on LeetCode.
- What is the time complexity of LeetCode 1446. Consecutive Characters?
The Python solution on this page runs in O(n), where n is the length of the string s.
- What is the space complexity of LeetCode 1446. Consecutive Characters?
The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 1446. Consecutive Characters cover?
LeetCode 1446. Consecutive Characters is tagged String on LeetCode.