算法159题 Longest Substring with at Most Two Distinct Characters 最大的子串

Posted 九师兄

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了算法159题 Longest Substring with at Most Two Distinct Characters 最大的子串相关的知识,希望对你有一定的参考价值。

1.概述

给定一个字符串。查找一个最长子序列,这个子序列中重复的字符最多包含2个。


此问题和 【算法】剑指 Offer 48. 最长不含重复字符的子字符串 问题很相似。

2.方案

2.1 双指针

public int lengthOfLongestSubstringTwoDistinct(String s) 
   
        M

以上是关于算法159题 Longest Substring with at Most Two Distinct Characters 最大的子串的主要内容,如果未能解决你的问题,请参考以下文章

Leetcode 159: Longest Substring with At Most Two Distinct Characters

159 Longest Substring with At Most Two Distinct Characters

[LC] 159. Longest Substring with At Most Two Distinct Characters

[LeetCode] 159. Longest Substring with At Most Two Distinct Characters

leetcode 159. Longest Substring with At Most Two Distinct Characters 求两个字母组成的最大子串长度 --------- jav

LeetCode-面试算法经典-Java实现05-Longest Palindromic Substring(最大回文字符串)