LeetCode 1446: Consecutive Characters Solution

Master LeetCode problem 1446 (Consecutive Characters), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1446. Consecutive Characters

Easy

Problem Explanation

Explanation

To solve this problem, we can iterate through the input string and keep track of the current character and the count of consecutive occurrences of that character. We update the maximum power whenever we encounter a new character or the count of consecutive occurrences increases. Finally, we return the maximum power as the result.

  • Initialize variables maxPower, currPower, prevChar to 1.
  • Iterate through the string starting from the second character.
  • If the current character is the same as the previous character, increment currPower.
  • If the current character is different, update maxPower if currPower is greater and reset currPower.
  • Return maxPower as the result.

Time Complexity: O(n) where n is the length of the input string s. Space Complexity: O(1)

Solution Code

class Solution {
    public int maxPower(String s) {
        int maxPower = 1;
        int currPower = 1;
        char prevChar = s.charAt(0);

        for (int i = 1; i < s.length(); i++) {
            if (s.charAt(i) == prevChar) {
                currPower++;
            } else {
                maxPower = Math.max(maxPower, currPower);
                currPower = 1;
                prevChar = s.charAt(i);
            }
        }

        return Math.max(maxPower, currPower);
    }
}

Try It Yourself

Loading code editor...

Related LeetCode Problems

Frequently Asked Questions

How to solve LeetCode 1446 (Consecutive Characters)?

This page provides optimized solutions for LeetCode problem 1446 (Consecutive Characters) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1446 (Consecutive Characters)?

The time complexity for LeetCode 1446 (Consecutive Characters) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1446 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1446 in Java, C++, or Python.

Back to LeetCode Solutions