1819. 最长双交替子串

1819. 最长双交替子串

 

给定一个长度为NN且只包含a和b的字符串SS。你需要找出最长的子串长度，使得其中不包含三个连续的字母。即，找出不包含aaa或bbb的最长子串长度。注意SS是其本身的子串。

样例

样例1

输入: "baaabbabbb"

输出: 7

说明: "aabbabb"是最长符合条件的子串

样例2

输入: "babba"

输出: 5

说明：整个S符合条件

样例3

输入: "abaaaa"

输出: 4

说明: "abaa"是最长符合条件的子串

注意事项

• NN 的取值范围是[1,200\,000][1,200000];
• 字符串SS只包含字符 a 和/或 b.

 

public class Solution {

    /**

     * @param s: the string

     * @return: length of longest semi alternating substring

     */

    public int longestSemiAlternatingSubstring(String s) {

           int sum=0;

            int start=0;

            // int end=s.length()-1;

            int a=0,b=0;

            for (int i = 0; i < s.length(); i++) {

                if (s.charAt(i)=='a'){

                    a++;

                    b=0;

                    if (a==3){

                        sum=Math.max(sum,i-start);

                        start=i-1;

                    }else if (a>3){

                        start=i-1;

                    }

                }else {

                    b++;

                    a=0;

                    if (b==3){

                        sum=Math.max(sum,i-start);

                        start=i-1;

                    }else if (b>3){

                        start=i-1;

                    }

                }

            }

            sum=Math.max(sum,s.length()-start);

            return sum;

    }

}