zoukankan      html  css  js  c++  java
  • 1446. Consecutive Characters (E)

    Consecutive Characters (E)

    题目

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

    Return the power of the string.

    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.
    

    Example 3:

    Input: s = "triplepillooooow"
    Output: 5
    

    Example 4:

    Input: s = "hooraaaaaaaaaaay"
    Output: 11
    

    Example 5:

    Input: s = "tourist"
    Output: 1
    

    Constraints:

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

    题意

    计算给定字符串中最长连续相同字符的长度。

    思路

    一次遍历。


    代码实现

    Java

    class Solution {
        public int maxPower(String s) {
            int ans = 0;
            int count = 0;
            for (int i = 0; i < s.length(); i++) {
                if (i > 0 && s.charAt(i) == s.charAt(i - 1)) {
                    count++;
                } else {
                    ans = Math.max(ans, count);
                    count = 1;
                }
            }
            ans = Math.max(ans, count);
            return ans;
        }
    }
    
  • 相关阅读:
    [洛谷P5408]第一类斯特林数·行
    11 React 组件生命周期
    10 React 组件 API
    9 React 列表 & Keys
    8 React 条件渲染
    7 React 事件处理
    6 React Props
    5 React State(状态)
    4 React 组件
    3 JSX语法
  • 原文地址:https://www.cnblogs.com/mapoos/p/13921988.html
Copyright © 2011-2022 走看看