LeetCode-in-Java

2414. Length of the Longest Alphabetical Continuous Substring

Medium

An alphabetical continuous string is a string consisting of consecutive letters in the alphabet. In other words, it is any substring of the string "abcdefghijklmnopqrstuvwxyz".

Given a string s consisting of lowercase letters only, return the length of the longest alphabetical continuous substring.

Example 1:

Input: s = “abacaba”

Output: 2

Explanation: There are 4 distinct continuous substrings: “a”, “b”, “c” and “ab”.

“ab” is the longest continuous substring.

Example 2:

Input: s = “abcde”

Output: 5

Explanation: “abcde” is the longest continuous substring.

Constraints:

Solution

public class Solution {
    public int longestContinuousSubstring(String s) {
        int ans = 0;
        int cnt = 1;
        int j = 1;
        while (j < s.length()) {
            if (s.charAt(j) == s.charAt(j - 1) + 1) {
                cnt++;
            } else {
                ans = Math.max(ans, cnt);
                cnt = 1;
            }
            j++;
        }
        return Math.max(ans, cnt);
    }
}