LC: 159. Longest Substring with At Most Two Distinct Characters

https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/

159. Longest Substring with At Most Two Distinct Characters

Given a string s, return the length of the longest substring that contains at most two distinct characters.

Example 1:

Input: s = "eceba"
Output: 3
Explanation: The substring is "ece" which its length is 3.

Example 2:

Input: s = "ccaabbb"
Output: 5
Explanation: The substring is "aabbb" which its length is 5.

Constraints:

1 <= s.length <= 105
s consists of English letters.

Details:

Zwei Zeiger a und b, die das letzte Vorkommen der beiden Zeichen im Index speichern, sind ausreichend. Die verarbeitete Länge wird inkrementiert, solange die beiden Zeichen wieder auftreten. Wenn ein drittes Zeichen vorkommt, sollte das mit dem neuesten Index für die neue verarbeitete Länge gezählt werden.

Solution(s) and Further Explanation:

159. Longest Substring with At Most Two Distinct Characters by altay9 · Pull Request #127 · spiralgo/algorithmsGitHub

Default Code:

class Solution {
    public int lengthOfLongestSubstringTwoDistinct(String s) {
        
    }
}

PreviousLC: 340. Longest Substring with At Most K Distinct Characters NextLC: 487. Max Consecutive Ones II

Last updated 3 years ago