leetcode 159: Longest Substring with At Most Two Distinct Characters

最新推荐文章于 2024-04-16 17:01:10 发布

xudli

最新推荐文章于 2024-04-16 17:01:10 发布

阅读量2.8k

点赞数 1

分类专栏： leetcode

本文链接：https://blog.csdn.net/xudli/article/details/43222593

版权

leetcode 专栏收录该内容

216 篇文章 0 订阅

订阅专栏

Total Accepted: 1167 Total Submissions: 3961

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

For example,Given s = “eceba”,

T is "ece" which its length is 3.

[分析]

用HASHTABLE 记录当前两个字符的数目, 如果遇到新字符, 移动start指针的位置, 直到新的start位置, 只包含两个字符. 这题思路很简单, 不知为何标为HARD. 也许有更优解, 不需要用extra space.

[code]

public class Solution {
    public int lengthOfLongestSubstringTwoDistinct(String s) {
        //input check
        if(s== null || s.length()==0) return 0;
        Map<Character, Integer> map = new HashMap<Character, Integer>();
        int start = 0;
        int max = 0;
        for(int i=0; i<s.length(); i++) {
            char c = s.charAt(i);
            if(map.containsKey(c)) {
                map.put( c,   map.get(c) + 1 );
            } else if(map.size() < 2) {
                map.put(c, 1);
            } else {
                while( (map.size()==2) && start<i) {
                    char temp = s.charAt(start);
                    int x = map.get(temp);
                    --x;
                    if(x==0) map.remove(s.charAt(start));
                    else map.put(s.charAt(start), x);
                    ++start;
                }
                map.put(c,1);
            }
            max = Math.max(max, i-start+1);
        }
        return max;
    }
}