LeetCode 159. Longest Substring with At Most Two Distinct Characters（最长字串）

原题网址：https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/

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.

方法：三个指针

public class Solution {
    public int lengthOfLongestSubstringTwoDistinct(String s) {
        if (s == null) return 0;
        if (s.length() <= 2) return s.length();
        char[] sa = s.toCharArray();
        int max = 0;
        int first = 0, second = 0, last = 0;
        int count = 0;
        for(int i=0; i<sa.length; i++) {
            if (count == 0) { first = i; count ++; }
            else if (count == 1 && sa[i] != sa[first]) { second = i; last = i; count ++; }
            else if (count == 2 && (sa[i] == sa[first] || sa[i] == sa[second]) && sa[i] != sa[i-1]) { last = i; }
            else if (count == 2 && (sa[i] != sa[first] && sa[i] != sa[second])) {first = last; second = i; last = i; }
            max = Math.max(max, i-first+1);
        }
        return max;
    }
}