LeetCode 159. Longest Substring with At Most Two Distinct Characters --Java,C++,Python解法

最新推荐文章于 2024-03-20 17:56:58 发布

zhangpeterx

最新推荐文章于 2024-03-20 17:56:58 发布

阅读量1k

点赞数

分类专栏： LeetCode python-做题 java-做题

本文链接：https://blog.csdn.net/zhangpeterx/article/details/100051285

版权

寻找字符串s中最多包含两种不同字符的最长子串长度。提供Python、C++和Java解法，题目难度为Hard。文章探讨了不同解法的思路和实现。

摘要由CSDN通过智能技术生成

题目地址：Longest Substring with At Most Two Distinct Characters - LeetCode

Given a string s , find the length of the longest substring t that contains at most 2 distinct characters.

Example 1:

Input: "eceba"
Output: 3
Explanation: t is "ece" which its length is 3.

Example 2:

Input: "ccaabbb"
Output: 5
Explanation: t is "aabbb" which its length is 5.

这道题目是hard难度的，题目的意思很简单，就是找到具有最多两个不同字符的最长子串的长度。

看到题目会感觉O(n)的时间复杂度应该能做出这道题目。

在写了大约20分钟代码后，Python解法出来了：

class Solution:
    def lengthOfLongestSubstringTwoDistinct(self, s: str) -> int:
        count = 0
        p = {
   }
        l = {
   }
        for now in range(0, len(s)):
            i = s[now]
            p[i] = now
            if len(l) < 2 and i not in l:
                l[i] = 1
            elif i in l:
                l[i] += 1
            else:
                if count < sum(l.values(