zoukankan      html  css  js  c++  java
  • 159.Longest Substring with At Most Two Distinct Characters

    class Solution {
    public:
        int lengthOfLongestSubstringTwoDistinct(string s) {
            int res = 0, left = 0;
            unordered_map<char, int> m;
            for (int i = 0; i < s.size(); ++i) {
                ++m[s[i]];
                while (m.size() > 2) {
                    if (--m[s[left]] == 0) m.erase(s[left]);
                    ++left;
                }
                res = max(res, i - left + 1);
            }
            return res;
        }
    };
    
    class Solution {
    public:
        int lengthOfLongestSubstringTwoDistinct(string s) {
            int res = 0, left = 0;
            unordered_map<char, int> m;
            for (int i = 0; i < s.size(); ++i) {
                m[s[i]] = i;
                while (m.size() > 2) {
                    if (m[s[left]] == left) m.erase(s[left]);
                    ++left;
                }
                res = max(res, i - left + 1);
            }
            return res;
        }
    };
    
  • 相关阅读:
    三数之和
    167
    二分搜索树
    687
    索引堆
    二分查找 leetcode704
    leetcode 56合并区间 java
    leetcode 1046
    堆的数据结构java
    leetcode 493
  • 原文地址:https://www.cnblogs.com/smallredness/p/10682140.html
Copyright © 2011-2022 走看看